Unary language operations and their nondeterministic state complexity

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

Volumn 2450, Issue , 2003, Pages 162-172

  Holzer, Markus ^a   Kutrib, Martin ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLEMENTATION; NONDETERMINISTIC FINITE AUTOMATON; NONDETERMINISTIC STATE; NUMBER OF STATE; TIGHT BOUND; UNARY LANGUAGES;

ARTIFICIAL INTELLIGENCE;

EID: 84949815129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45005-x_14     Document Type: Conference Paper

References (21)

1. Berman, P. and Lingas, A. On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences, 1977.
2. Birget, J.-C. State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory 26 (1993), 237–269.
3. Chrobak, M. Finite automata and unary languages. Theoretical Computer Science 47 (1986), 149–158.
4. Holzer, M. and Kutrib, M. State complexity of basic operations on nondeterministic finite automata. Implementation and Application of Automata (CIAA’02), 2002, pp. 151–160.
5. Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
6. Hunt, H. B., Rosenkrantz, D. J., and Szymanski, T. G. On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences 12 (1976), 222–268.
7. Jiang, T. and Ravikumar, B. Minimal NFA problems are hard. SIAM Journal on Computing 22 (1993), 1117–1141.
8. Landau, E. Uber die Maximalordnung der Permutationen gegebenen Grades. Archiv der Math. und Phys. 3 (1903), 92–103.
9. Landau, E. Handbuch der Lehre von der Verteilung der Primzahlen. Teubner, Leipzig, 1909.
10. Mereghetti, C. and Pighizzini, G. Two-way automata simulations and unary languages. Journal of Automata, Languages and Combinatorics 5 (2000), 287–300.
11. Mereghetti, C. and Pighizzini, G. Optimal simulations between unary automata. SIAM Journal on Computing 30 (2001), 1976–1992.
12. Nicaud, C. Average state complexity of operations on unary automata. Mathematical Foundations of Computer Science (MFCS’99) LNCS 1672, 1999, pp. 231–240.
13. Pighizzini, G. and Shallit, J. O. Unary language operations, state complexity and Jacobsthal’s function. International Journal of Foundations of Computer Science 13 (2002), 145–159.
14. Sakoda, W. J. and Sipser, M. Nondeterminism and the size of two way finite automata. ACM Symposium on Theory of Computing (STOC’78), 1978, pp. 275– 286.
15. Salomaa, K. and Yu, S. NFA to DFA transformation for finite languages over arbitrary alphabets. Journal of Automata, Languages and Combinatorics 2 (1997), 177–186.
16. Shallit, J. O. and Ellul, K. Personal communication, October 2002.
17. Sipser, M. Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences 21 (1980), 195–202.
18. Stockmeyer, L. J. and Meyer, A. R. Word problems requiring exponential time. ACM Symposium on Theory of Computing (STOC’73), 1973, pp. 1–9.
19. Szalay, M. On the maximal order in Sn and S n. Acta Arithm. 37 (1980), 321–331.
20. Yu, S. State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6 (2001), 221–234.
21. Yu, S. State complexity of finite and infinite regular languages. Bulletin of the EATCS 76 (2002), 142–152.