Optimal simulations between unary automata

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1976-1992

  Mereghetti, Carlo ^a   Pighizzini, Giovanni ^b  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

And alternating finite state automata; Formal languages; deterministic; Nondeterministic; Unary languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE AUTOMATA; FORMAL LANGUAGES; FUNCTION EVALUATION; GRAPH THEORY; NUMBER THEORY;

DETERMINISTIC AUTOMATA; DIOPANTHENE EQUATION; NONDETERMINISTIC AUTOMATA; OPTIMAL SIMULATIONS; UNARY AUTOMATA; UNARY LANGUAGES;

OPTIMIZATION;

EID: 0035704538     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s009753979935431x     Document Type: Article

References (30)

1. C. BERGE, Graphs and Hypergraphs, North-Holland, Amsterdam, 1985.
2. P. HERMAN AND A. LINGAS, On the Complexity of Regular Languages in Terms of Finite Automata, Tech. Report 304, Polish Academy of Sciences, 1977.
3. J.-C. BIRGET, State-complexity of finite-state devices, state compressibility and incompressibility, Math. Systems Theory, 26 (1993), pp. 237-269
4. A. BRAUER, On a problem of partitions, Amer. J. Math., 64 (1942), pp. 299-312.
5. A. BRAUER AND J.E. SHOCKLEY, On a problem of Frobenius, J. Reine Angew. Math., 211 (1962), pp. 215-220.
6. J.A. BRZOZOWSKI AND E. LEISS, On equations for regular languages, finite automata, and sequential networks, Theoret. Comput. Sei., 10 (1980), pp. 19-35
7. A. CHANDRA, D. KOZEN, AND L. STOCKMEYER, Alternation, J. ACM, 28 (1981), pp. 114-133.
8. M. CHROBAK, Finite automata and unary languages, Theoret. Comput. Sei., 47 (1986), pp. 149-158.
9. P. ERDöS AND R.L. GRAHAM, On a linear diophantine problem of Frobenius, Acta Arith., 37 (1980), pp. 321-331.
10. A. FELLAH, H. JüRGENSEN, AND S. Yu, Constructions for alternating finite automata, Internat. J. Comput. Math., 35 (1990), pp. 117-132.
11. V. GEFFERT, Nondeterministic computations in sublogarithmic space and space constructibility, SIAM J. Comput., 20 (1991), pp. 484-498
12. V. GEFFERT, Tally version of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space, SIAM J. Comput., 22 (1993), pp. 102-113.
13. V. GEFFERT, private communication, 1997.
14. J. HOPCROFT AND J. UtLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
15. E. LANDAU, Über die maximalordung der permutationen gegebenen grades, Archiv, der Math. und Phys., 3 (1903), pp. 92-103.
16. E. LANDAU, Handbuch der lehre von der Verteilung der primzahlen. I, Teubner, Leipzig, Berlin, 1909.
17. E. LEISS, Succinct representation of regular languages by boolean automata, Theoret. Comput. Sei., 13 (1981), pp. 323-330.
18. P. LEWIS II, R. STEARNS, AND J. HARTMANIS, Memory bounds for recognition of context free and context sensitive languages, in IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 191-202.
19. U. LlUBlCZ, Bounds for the optimal determinization of nondeterministic autonomie automata, Sibirskii Maternât. Journal, 2 (1964), pp. 337-355 (in Russian).
20. C. MEREGHETTI AND G. PIGIIIZZINI, Optimal simulations between unary automata, in 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sei. 1373, Springer-Verlag, Berlin, 1998, pp. 139-149.
21. I. NIVEN AND H.S. ZUCKERMAN, An Introduction to the Theory of Numbers, John Wiley & Sons, New York, 1980.
22. M. RABIN AND D. SCOTT, Finite automata and their decision problems, IBM J. Res. Develop, 3 (1959), pp. 114-125.
23. Also in E.F. Moore, Sequential Machines, Addison-Wesley, Reading, MA, 1964, pp. 63-91.
24. \V. SAKODA AND M. SIPSER, Nondeterminism and the size of two-way finite automata, in Proceedings 10th ACM Symposium on Theory of Computing, 1978, pp. 275-286.
25. J.C. SHEPHERDSON, The reduction of two-way automata to one-way automata, IBM J. Res. Develop, 3 (1959), pp. 198-200.
26. Also in E.F. Moore, Sequential Machines, Addison-Wesley, Reading, MA, 1964, pp. 92-97.
27. M. SIPSER, Lower bounds on the size of sweeping automata, J. Comput. System Sei., 21 (1980), pp. 195-202.
28. M. SZALAY, On the maximal order in Sn and S, Acta Arith., 37 (1980), pp. 321-331.
29. A. SZEPIETOWSKI, Turing Machines with Sublogarithmic Space, Lecture Notes in Comput. Sei. 843, Springer-Verlag, New York, 1994.
30. P. TuRAN, Combinatorics, partitions, group theory, in Colloquio Internazionale sulle Teorie Combinatorie, B. Serge, ed., Accademia Nazionale dei Lincei, Rome, 1976, pp. 181-200.