Running time to recognize nonregular languages by 2-way probabilistic automata-Reference-Cited by-同舟云学术

Running time to recognize nonregular languages by 2-way probabilistic automata

Published:1991 Issue: Volume: Page:174-185
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Kaņeps Jānis,Freivalds Rūsiņš

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_133.pdf

Reference20 articles.

1. A.Andžāns. On advantages of probabilistic automata over deterministic ones in maze walks and recognition of 2-dimensional domains.-In: Probabilistic Automata and their Applications. Kazan University Press, 1986, p.64–68 (Russian).

2. M.Blum and C.Hewitt. Automata on a 2-dimensional tape.-Proc. 8th Annual Symp. on Switching and Automata Theory, 1967, p.155–160.

3. C.Dwork and L.Stockmeyer. Interactive proof systems with finite state verifiers.-Report RJ 6262, IBM Research Division, San Jose, CA, 1988.

4. C.Dwork and L.Stockmeyer. On the power of 2-way probabilistic finite state automata.-Proc. 30th FOCS, 1989, p.480–485.

5. C. Dwork and L. Stockmeyer. A time complexity gap for two-way probabilistic finite state automata.-SIAM Journal of Computing, December 1990, v.19,No.6,p.1011–1023.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finite State Verifiers with Constant Randomness;Lecture Notes in Computer Science;2012

2. An overview of quantum computation models: quantum automata;Frontiers of Computer Science in China;2008-06

3. Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States;Algorithms and Computation;2008

4. Some Observations on Two-Way Finite Automata with Quantum and Classical States;Lecture Notes in Computer Science;2008

5. Similarity relations and cover automata;RAIRO - Theoretical Informatics and Applications;2005-01