Nondeterministic descriptional complexity of regular languages

International Journal of Foundations of Computer Science

Volumn 14, Issue 6, 2003, Pages 1087-1102

  Holzer, Markus ^a   Kutrib, Martin ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

language operations; nondeterministic finite automata; state complexity

Indexed keywords

EID: 11844303665     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103002199     Document Type: Conference Paper

References (28)

1. P. Berman, and A. Lingas, "On the complexity of regular languages in terms of finite automata," Technical Report 304, Polish Academy of Sciences, 1977.
2. J.-C. Birget, "Partial orders on words, minimal elements of regular languages and state complexity," Theoret. Comput. Sci. 119 (1993) 267-291.
3. J.-C. Birget, "State-complexity of finite-state devices, state compressibility and incompressibility," Math. Systems Theory 26 (1993) 237-269.
4. J.-C. Birget, Personal communication, October 2002.
5. C. Campeanu, K. Culik, K. Salomaa and S. Yu, "State complexity of basic operations on finite languages," Proc. J^th International Workshop on Implementing Automata (WIA '99), LNCS 2214, 2001, pp. 60-70.
6. C. Campeanu, N. Santean and S. Yu, "Minimal cover-automata for finite languages," Theoret. Comput. Sci. 267 (2001) 3-16.
7. M. Chrobak, "Finite automata and unary languages," Theoret. Comput. Sci. 47 (1986) 149-158.
8. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Language, and Computation (Addison-Wesley, Reading, Massachusetts, 1979).
9. H. B. Hunt, D. J. Rosenkrantz and T. G. Szymanski, "On the equivalence, containment, and covering problems for the regular and context-free languages," J. Comput. System Sci. 12 (1976) 222-268.
10. T. Jiang and B. Ravikumar, "Minimal NFA problems are hard," SIAM J. Comput. 22 (1993) 1117-1141.
11. E. Landau, "Uber die Maximalordnung der Permutationen gegebenen Grades," Archiv der Math, und Phys. 3 (1903) 92-103.
12. E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen. (Teubner, Leipzig, 1909).
13. E. Leiss, "Succinct representation of regular languages by Boolean automata," Theoret. Comput. Set. 13 (1981) 323-330.
14. C. Mereghetti and G. Pighizzini, "Two-way automata simulations and unary languages," J. Aut. Lang, and Comb. 5 (2000) 287-300.
15. C. Mereghetti and G. Pighizzini, "Optimal simulations between unary automata," SIAM J. Comput. 30 (2001) 1976-1992.
16. A. R. Meyer and M. J. Fischer, "Economy of description by automata, grammars, and formal systems," Proc. 12th Annual IEEE Symposium on Switching and Automata Theory, 1971, pp. 188-191.
17. C. Nicaud, "Average state complexity of operations on unary automata," Proc. Mathematical Foundations of Computer Science (MFCS '99), LNCS 1672, 1999, pp. 231-240.
18. G. Pighizzini and J. O. Shallit, "Unary language operations, state complexity and Jacobsthal's function," Int. J. Found. Comput. Sci. 13 (2002) 145-159.
19. W. J. Sakoda and M. Sipser, "Nondeterminism and the size of two way finite automata," Proc. 10th Annual ACM Symposium on Theory of Computing (STOC '78), 1978, pp. 275-286.
20. K. Salomaa and S. Yu, "NFA to DFA transformation for finite languages over arbitrary alphabets," J. Aut, Lang, and Comb. 2 (1997) 177-186.
21. J. O. Shallit and K. Ellul, Personal communication, October 2002.
22. S. Sipser, "Lower bounds on the size of sweeping automata," J. Comput. System Sci. 21 (1980) 195-202.
23. L. J. Stockmeyer and A. R. Meyer, "Word problems requiring exponential time," Proc. 5th Annual ACM Symposium on Theory of Computing (STOC '73), 1973, pp. 1-9.
24. M. Szalay, "On the maximal order in S., and S," Acta Arithm. 37 (1980) 321-331.
25. S. Yu, "Regular languages," in Handbook of Formal Languages 1, eds. G. Rozenberg and A. Salomaa (Springer, Berlin, 1997) chapter 2, pp. 41-110.
26. S. Yu, "State complexity of regular languages," J. Aut. Lang, and Comb. 6 (2001) 221-234.
27. S. Yu, "State complexity of finite and infinite regular languages," Bull. EATCS 76 (2002) 142-152.
28. S. Yu, Q. Zhuang and K. Salomaa, "The state complexities of some basic operations on regular languages," Theoret. Comput. Sci. 125 (1994) 315-328.