Complementing unary nondeterministic automata

Theoretical Computer Science

Volumn 330, Issue 2, 2005, Pages 349-360

  Mera, Filippo ^a   Pighizzini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Complementation; Descriptional complexity; Finite state automata; Formal languages; Unary languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; GRAPH THEORY; MATHEMATICAL MODELS;

COMPLEMENTATION; DESCRIPTIONAL COMPLEXITY; DETERMINISTIC AUTOMATON; UNARY LANGUAGES;

FINITE AUTOMATA;

EID: 11844273805     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.015     Document Type: Conference Paper

References (24)

1. J.C. Birget Partial orders on words, minimal elements of regular languages, and state complexity Theoret. Comput. Sci. 119 1993 267 291 Erratum available at http://clam.rutgers.edu/~birget/papers.html
2. M. Chrobak Finite automata and unary languages Theoret. Comput. Sci. 47 1986 149 158 Erratum Theoret. Comput. Sci. 302 (2003) 497-498
3. K. Ellul, Descriptional complexity measures of regular languages, M. Math. Thesis, University of Waterloo, 2002.
4. J. Goldstine, M. Kappes, C. Kintala, H. Leung, A. Malcher, and D. Wotschke Descriptional complexity of machines with limited resources J. Univ. Comput. Sci. 8 2 2002 193 234
5. G.H. Hardy, and E.M. Wright An Introduction to the Theory of Numbers fifth ed. 1979 Oxford Science Publications Oxford
6. M. Holzer, M. Kutrib, Unary language operations and their nondeterministic state complexity, Developments in Language Theory, DLT 2002, Lecture Notes in Computer Science, vol. 2459, 2003, pp. 162-172.
7. M. Holzer, and M. Kutrib Nondeterministic descriptional complexity of regular languages Internat. J. Found. Comput. Sci. 14 2003 1087 1102
8. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation second ed. 2001 Addison-Wesley Reading, MA
9. J. Hromkovǐ, Descriptional complexity of regular languages (concepts and open problems), Proc. Descriptional Complexity of Automata, Grammars and Related Structures, Vienna, 2001, Report 16-2001, Otto-Von-Guericke-Universität Magdeburg, pp. 11-13.
10. T. Jiang, E. McDowell, and B. Ravikumar The structure and complexity of minimal nfa's over a unary alphabet Internat. J. Found. Comput. Sci. 2 1991 163 182
11. G. Jirásková, State complexity of some operations on regular languages, Proc. Descriptional Complexity of Formal Systems 2003, MTA SZTAKI, Budapest, pp. 114-125.
12. E. Landau Über die maximalordnung der permutationen gegebenen grades Arch. Math. Phys. 3 1903 92 103
13. E. Landau Handbuch der Lehre von der Verteilung der Primzahlen I 1909 Teubner Leipzig, Berlin
14. E. Leiss Succinct representation of regular languages by boolean automata Theoret. Comput. Sci. 13 1981 323 330
15. C. Mereghetti, and G. Pighizzini Two-way automata simulations and unary languages J. Automat. Languages Combin. 5 2000 287 300
16. C. Mereghetti, and G. Pighizzini Optimal simulations between unary automata SIAM J. Comput. 30 2001 1976 1992
17. A. Meyer, and M. Fischer Economy of description by automata, grammars, and formal systems Proc. 12th Annual IEEE Symp. Switching and Automata Theory 1971 188 191
18. F. Moore On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic and two-way finite automata by deterministic automata IEEE Trans. Comput. C-20 1971 1211 1219
19. C. Nicaud, Average state complexity of operations on unary automata, Proc. MFCS'99, Lecture Notes in Computer Science, vol. 1672, 1999, pp. 231-240.
20. G. Pighizzini, and J.O. Shallit Unary languages operations, state complexity and Jacobsthal's function Internat. J. Found. Comput. Sci. 13 2002 145 159
21. M.O. Rabin, and D. Scott Finite automata and their decision problems IBM J. Res. Develop. 3 1959 198 200 also in: E.F. Moore (Ed.), Sequential Machines: Selected Papers, Addison-Wesley, Reading, MA, 1964, pp. 63-91
22. M. Szalay On the maximal order in S n and S n * Acta Arith. 37 1980 321 331
23. S. Yu A renaissance of automata theory? EATCS Bull. 72 2000 270 272
24. S. Yu State complexity of regular languages J. Automat. Languages Combin. 6 2001 221 234