Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser's separation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 439-451

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Descriptional complexity of regular languages; Finite automata; Nondeterminism

Indexed keywords

CONTEXT FREE LANGUAGES; FINITE AUTOMATA;

DESCRIPTIONAL COMPLEXITY; LOWER BOUNDS; NON-DETERMINISM; TWO-WAY AUTOMATA; TWO-WAY FINITE AUTOMATA;

COMPUTATIONAL LINGUISTICS;

EID: 21144441090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_36     Document Type: Article

References (17)

1. P. Berman: A note on sweeping automata. In: Proc. 7th ICALP. Lecture Notes in Computer Science 85, Springer 1980, pp. 91-97.
2. P. Ďuriš, J. Hromkovič, S. Jukna, M. Sauerhoff, G. Schnitger: On multipartition communication complexity. In: Proc. STACS '01. Lecture Notes in Computer Science 2010, Springer 2001, pp 206-217.
3. J. Hromkovič: Communication Complexity and Parallel Computing. Springer 1997.
4. J. Hromkovič, G. Schnitger: On the power of Las Vegas II: Two-way finite automata. Theoretical Computer Science 262 (2001), 1-24.
5. J. Hromkovič, J. Karhumäki, H. Klauck, G. Schnitger, S. Seibert: Measures of nondeterminism in finite automata. In: Proc. 27th ICALP, Lecture Notes in Computer Science 1853, Springer-Verlag 2000, pp. 194-21,
6. full version: Information and Computation 172 (2002), 202-217.
7. D. A. Huffman: The synthesis of sequential switching circuits. J. Franklin Inst. 257, No. 3-4 (1954), pp. 161-190 and pp. 257-303.
8. H. Leung: Tight lower bounds on the size of sweeping automata. J. Comp. System Sciences, to appear.
9. G. M. Mealy: A method for synthesizing sequential circuits. Bell System Technical Journal 34, No. 5 (1955), pp. 1045-1079.
10. A. Meyer and M. Fischer: Economy in description by automata, grammars and formal systems. In: Proc. 12th SWAT Symp., 1971, pp. 188-191.
11. S. Micali: Two-way deterministic automata are exponentially more succinct than sweeping automata. Inform. Proc. Letters 12 (1981), 103-105.
12. E. F. Moore: Gedanken experiments on sequential machines. In: [14], pp. 129-153.
13. F. Moore: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic and two-way finite automata. IEEE Trans. Comput. 10 (1971), 1211-1214.
14. M. O. Rabin, D. Scott: Finite automata and their decision problems. In: IBM J. Research and Development, 3 (1959), pp. 115-125.
15. W. J. Sakoda, M. Sipser: Nondeterminism and the size of two-way finite automata. In: Proc. 10th ACM STOC, 1978, pp. 275-286.
16. C. E. Shannon and J. McCarthy: Automata Studies. Princeton University Press, 1956.
17. M. Sipser: Lower bounds on the size of sweeping automata. J. Comp. System Sciences 21 (1980), 195-202.