Converting two-way nondeterministic unary automata into simpler automata

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 189-203

  Geffert, Viliam ^a   Mereghetti, Carlo ^b   Pighizzini, Giovanni ^c  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b Bicocca Edificio U7   (Italy)

^c UNIVERSITY OF MILAN   (Italy)

Author keywords

Finite state automata; Formal languages; Unary languages

Indexed keywords

COMPUTER SIMULATION; FORMAL LANGUAGES; THEOREM PROVING;

UNARY LANGUAGES;

FINITE AUTOMATA;

EID: 0037463535     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00403-6     Document Type: Conference Paper

References (13)

1. Berman P. A note on sweeping automata. de Bakker J.W., van Leeuwen J. Proc. 7th Internat. Colloq. on Aut. Lang. Progr. Lecture Notes in Computer Science. Vol. 85:1980;91-97 Springer, Berlin.
2. P. Berman, A. Lingas, On the complexity of regular languages in terms of finite automata, Tech. Rep. 304, Polish Academy of Sciences, 1977.
3. Birget J.-C. Two-way automaton computations. Theoret. Inform. Appl. 24:1990;47-66.
4. Chrobak M. Finite automata and unary languages. Theoret. Comput. Sci. 47:1986;149-158.
5. Geffert V. Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Comput. 20:1991;484-498.
6. Hopcroft J., Ullman J. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
7. Mereghetti C., Pighizzini G. Two-way automata simulations and unary languages. J. Automat. Lang. Combin. 5:2000;287-300.
8. Mereghetti C., Pighizzini G. Optimal simulations between unary automata. SIAM J. Comput. 30:2001;1976-1992.
9. Micali S. Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Inform. Process. Lett. 12:1981;103-105.
10. Piterman N., Vardi M.Y. From bidirectionality to alternation. Sgall J., Pultr A., Kolman P. Proc. 26th Math. Found. Computer Science. Lecture Notes in Computer Science. Vol. 2136:2001;598-610 Springer, Berlin.
11. W. Sakoda, M. Sipser, Nondeterminism and the size of two-way finite automata, in: Proc. 10th ACM Symp. on Theory of Computing, 1978, pp. 275-286.
12. Sipser M. Lower bounds on the size of sweeping automata. J. Comput. System Sci. 21:1980;195-202.
13. Vardi M.Y. A note on the reduction of two-way automata to one-way automata. Inform. Process. Lett. 30:1989;261-264.