State complexity of NFA to DFA conversion for subregular language families

Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008

Volumn , Issue , 2008, Pages 85-96

  Bordihn, Henning ^a   Holze, Markus ^b   Kutrib, Martin ^c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

Determinization; Finite automata; State complexity; Subregular languages

Indexed keywords

CONTEXT FREE GRAMMARS; DISPERSION COMPENSATION; PIPELINE PROCESSING SYSTEMS;

DESCRIPTIONAL COMPLEXITY; DETERMINISTIC FINITE AUTOMATA; DETERMINIZATION; NONDETERMINISTIC FINITE AUTOMATON; NUMBER OF STATE; STAR-FREE LANGUAGES; STATE COMPLEXITY; SUBREGULAR LANGUAGES;

FINITE AUTOMATA;

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

References (12)

1. M. Chrobak. Finite automata and unary languages. Theoret. Comput. Sci., 47(2), 149- 158, 1986.
2. M. Chrobak. Errata to "finite automata and unary languages". Theoret. Comput. Sci., 302, 497-498, 2003.
3. A. Gill and L. T. Kou. Multiple-entry finite automata. J. Comput. System Sci., 9, 1-19, 1974.
4. I. M. Havel. The theory of regular events II. Kybernetica, 6, 520-544, 1969.
5. J.-Y. Kao, A. Malton, N. Rampersad, and J. Shallit. On NFA's where all states are final, initial, or both. Unpublished manuscript.
6. A. R. Meyer and M. J. Fischer. Economy of description by automata, grammars, and formal systems. In 12th Ann. IEEE Symposium on Switching and Automata Theory, 188-191. IEEE, 1971.
7. F. R. 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(10), 1211-1214, 1971.
8. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Dev., 3, 114-125, 1959.
9. K. Salomaa and S. Yu. NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom., Lang. Comb., 2, 177-186, 1997.
10. H.-J. Shyr and G. Thierrin. Ordered automata and associated languages. Tamkang J. Math., 5, 9-20, 1974.
11. H.-J. Shyr and G. Thierrin. Power-separating regular languages. Math. Systems Theory, 8, 90-95, 1974.
12. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 2, 41-110. Springer, Berlin, 1997.