Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Shuffling cards and stopping times;Aldous;American Mathematical Monthly,1986
2. H. Alt, K. Mehlhorn, Lower bounds for the space complexity for context-free recognition, in: Proc. of ICALP, 1976, pp. 338–351
3. M. Blum, C. Hewitt, Automata on a two-dimensional tape, in: Proc. of the 8th IEEE Conf. on Switching and Automata Theory, 1967, pp. 155–160
4. Parallel computation for well-endowed rings and space-bounded probabilistic machines;Borodin;Information and Control,1983
5. A. Condon, R. Lipton, On interactive proofs with space-bounded verifiers, in: Proc. of 30th IEEE Annual Symposium on Foundations of Computer Science, 1989, pp. 462–467
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adding pebbles to weighted automata: Easy specification & efficient evaluation;Theoretical Computer Science;2014-05
2. One-Counter Verifiers for Decidable Languages;Computer Science – Theory and Applications;2013
3. A Probabilistic Kleene Theorem;Automated Technology for Verification and Analysis;2012
4. Adding Pebbles to Weighted Automata;Implementation and Application of Automata;2012