Optimal simulations between unary automata

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

Volumn 1373 LNCS, Issue , 1998, Pages 139-149

  Mereghetti, Carlo ^a   Pighizzini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC AUTOMATA; NONDETERMINISTIC AUTOMATA; NONDETERMINISTIC CHOICE; UNARY LANGUAGES;

COMPUTER SCIENCE; FINITE AUTOMATA; OPTIMIZATION;

TRANSLATION (LANGUAGES);

EID: 0000092703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028556     Document Type: Conference Paper

References (13)

1. C. Berge. Graphs and Hypergraphs. North-Holland, 1985.
2. J.-C. Birget. State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory, 26:237-269, 1993.
3. P. Berman and A. Lingas. On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences, 1977.
4. M. Chrobak. Finite automata and unary languages. Theoretical Computer Science, 47:149-158, 1986.
5. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114-133, 1981.
6. A. Fellah, H. Jürgensen, and S. Yu. Constructions for alternating finite automata. International J. Computer Math., 35:117-132, 1990.
7. V. Geffert. Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Computing, 20:484-498, 1991.
8. V. Geffert, 1997. Private communication.
9. E. Gurari and O. Ibarra. Simple counter machines and number-theoretic problems. Journal of Computer and System Sciences, 19:145-162, 1979.
10. E. Gurari and O. Ibarra. Two-way counter machines and Diophantine equations. Journal of the ACM, 29:863-873, 1982.
11. J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA, 1979.
12. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop, 3:114-125, 1959.
13. W. Sakoda and M. Sipser. Nondeterminism and the size of two-way finite automata. In Proc. 10th ACM Symposium on Theory of Computing, pages 275-286, 1978.