Magic numbers in the state hierarchy of finite automata

Information and Computation

Volumn 205, Issue 11, 2007, Pages 1652-1670

  Geffert, Viliam ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Descriptional complexity; Finite state automata; Regular languages

Indexed keywords

FINITE AUTOMATA; FORMAL LANGUAGES; INFORMATION DISSEMINATION;

DESCRIPTIONAL COMPLEXITY; DETERMINISTIC FINITE STATE AUTOMATA; LOWER BOUNDS; MAGIC NUMBERS; NON-DETERMINISM; NONDETERMINISTIC FINITE-STATE AUTOMATON; NUMBER OF STATE;

CONTEXT FREE LANGUAGES;

EID: 84855202048     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.07.001     Document Type: Article

References (25)

1. H. Alt, Lower bounds on space complexity for context-free recognition, Acta Inform. 12 (1979) 33-61. (Pubitemid 9477533)
2. H. Alt, V. Geffert, K. Mehlhorn, A lower bound for the nondeterministic space complexity of context-free recognition, Inform. Process. Lett. 42 (1992) 25-27. (Pubitemid 23627664)
3. A. Bertoni, C. Mereghetti, G. Pighizzini, An optimal lower bound for nonregular languages, Inform. Process. Lett. 50 (1994) 289-292. (Pubitemid 124012550)
4. (Corrigendum: 1994, Inform. Process. Lett. 52, 339.)
5. M. Chrobak, Finite automata and unary languages, Theor. Comput. Sci. 47 (1986) 149-158
6. (Corrigendum: 2003, Theor. Comput. Sci. 302, 497-498).
7. V. Geffert, Nondeterministic computations in sublogarithmic space and space constructibility, SIAM J. Comput. 20 (1991) 484-498. (Pubitemid 21668553)
8. V. Geffert, Space hierarchy theorem revised, Theor. Comput. Sci. 295 (2003) 171-187.
9. V. Geffert, (Non) determinism and the size of one-way finite automata, in: Proc. Descr. Compl. Formal Systems, IFIP & University Milano, 2005, pp. 23-37.
10. V. Geffert, C. Mereghetti, G. Pighizzini, Converting two-way nondeterministic unary automata into simpler automata, Theor. Comput. Sci. 295 (2003) 189-203.
11. G. Hardy, E. Wright, An Introduction to the Theory of Numbers, fifth ed., Oxford University Press, 1979.
12. J. Hopcroft, R. Motwani, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001.
13. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
14. K. Iwama, Y. Kambayashi, K. Takaki, Tight bounds on the number of states of DFA's that are equivalent to n-state NFA's, Theor. Comput. Sci. 237 (2000) 485-494.
15. n - α deterministic states, Theor. Comput. Sci. 301 (2003) 451-462.
16. G. Jirásková, Note on minimal finite automata, in: Proc. Math. Found. Comput. Sci., Lect. Notes Comput. Sci, 2136, Springer-Verlag, 2001, pp. 421-431. (Pubitemid 33322431)
17. Ju. I. Ljubiç, Ocenki dljaoptimaĺnoj determinizaciinedeterminirovannyh avtonomnyh avtomatov, Sibirsk. Mat. Zh. V/2 (1964) 337-355. (in Russian)
18. O. B. Lupanov, Uber den Vergleich zweier Typen endlicher Quellen, Probleme der Kybernetik 6 (1966) 329-335. (Akademie-Verlag, Berlin, in German)
19. C. Mereghetti, G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30 (2001) 1976-1992. (Pubitemid 34125445)
20. 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. C-20 (1971) 1211-1214.
21. M. Rabin, D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959) 114-125.
22. W. Sakoda, M. Sipser, Nondeterminism and the size of two-way finite automata, in Proc. ACM Symp. Theory of Comput, 1978, pp. 275-286.
23. A. Salomaa, D. Wood, S. Yu, On the state complexity of reversals of regular languages, Theor. Comput. Sci. 320 (2004) 315-329.
24. n, Acta Arith. 37 (1980) 321-331.
25. S. Y. Yau, Number Theory for Computing, Springer-Verlag, 2002.