(Non)determinism and the size of one-way finite automata

7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings

Volumn , Issue , 2005, Pages 23-37

  Geffert, Viliam ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Descriptional complexity; Finite state automata; Regular languages

Indexed keywords

DISPERSION COMPENSATION; FINITE AUTOMATA; FORMAL LANGUAGES;

BLOW-UP; DESCRIPTIONAL COMPLEXITY; FINITE-STATE AUTOMATA; LARGE N; NUMBER OF STATE; REAL CONSTANTS;

CONTEXT FREE LANGUAGES;

EID: 84905821970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Chrobak. Finite automata and unary languages. Theoret. Comput. Sci., 47 (1986), pp. 149-58.
2. V. Geffert. Bridging across the log(n) space frontier. Inform. & Comput., 142 (1998), pp. 127-58.
3. V. Geffert. Space hierarchy theorem revised. Theoret. Comput. Sci., 295 (2003), pp. 171-87.
4. V. Geffert, C. Mereghetti, and G. Pighizzini. Converting two-way nondeterministic unary automata into simpler automata. Theoret. Comput. Sci., 295 (2003), pp. 189-203.
5. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1994.
6. G. Hardy and E. Wright. An Introduction to the Theory of Numbers. Clarendon Press Oxford, 1995. (Reprint of 5th edit., 1979.).
7. J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.
8. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
9. K. Iwama, Y. Kambayashi, and K. Takaki. Tight bounds on the number of states of DFA's that are equivalent to n-state NFA's. Theoret. Comput. Sci., 237 (2000), pp. 485-94.
10. n - α deterministic states. Theoret. Comput. Sci., 301 (2003), pp. 451-62.
11. G. Jiraskova. Note on minimal finite automata. In Math. Found. Comput. Sci., Lect. Notes Comput. Sci. 2136, Springer, 2001, pp. 421-31.
12. O. B. Lupanov. Uber den Vergleich zweier Typen endlicher Quellen. Probleme der Kybernetik, 6 (1966), pp. 329-35. (Akademie-Verlag, Berlin.).
13. C. Mereghetti and G. Pighizzini. Optimal simulations between unary automata. SIAM J. Comput., 30 (2001), pp. 1976-92.
14. 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., 20 (1971), pp. 1211-14.
15. M. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop., 3 (1959), pp. 114-25.
16. O. Ramare. On Snirefman's constant. Ann. Scuola Norm. Sup. Pisa CI. Sci., 22 (1995), pp. 645-706.
17. K. Rossen. Elementary Number Theory and Its Applications. Addison-Wesley, 1993.
18. W. Sakoda and M. Sipser. Nondeterminism and the size of two-way finite automata. In ACM Symp. Theory of Comput., 1978, pp. 275-86.
19. A. Salomaa, D. Wood, and S. Yu.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci., 320 (2004), pp. 315-29.
20. S. Y. Yau. Number Theory for Computing. Springer, 2002.