State complexity of basic operations on nondeterministic finite automata

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

Volumn 2608, Issue , 2003, Pages 148-157

  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

FINITE AUTOMATA; NANOSTRUCTURED MATERIALS; ROBOTS;

BASIC OPERATION; BOOLEAN OPERATIONS; COMPLEMENTATION; DETERMINISTIC FINITE AUTOMATA; LINEAR COMPLEXITY; NONDETERMINISTIC FINITE AUTOMATON; NUMBER OF STATE; STATE COMPLEXITY;

PIPELINE PROCESSING SYSTEMS;

EID: 35248861734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44977-9_14     Document Type: Article

References (15)

1. Câmpeanu, C., Čulik, K., Salomaa, K., and Yu, S. State complexity of basic operations on finite languages. Fourth International Workshop on Implementing Automata, LNCS 2214, pp. 60-70.
2. Câmpeanu, C., Sântean, N., and Yu, S. Minimal cover-automata for finite languages. Theoret. Comput. Sci. 267 (2001), 3-16.
3. Goldstine, J., Kintala, C., and Wotschke, D. On measuring nondeterminism in regular languages. Inform. Comput. 86 (1990), 179-194.
4. Goldstine, J., Leung, H., and Wotschke, D. On the relation between ambiguity and nondeterminism in finite automata. Inform. Comput. 100 (1992), 261-270.
5. Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
6. Kintala, C. M. and Wotschke, D. Amounts of nondeterminism in finite automata. Acta Inf. 13 (1980), 199-204.
7. Leiss, E. Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci. 13 (1981), 323-330.
8. Mereghetti, C. and Pighizzini, G. Optimal simulations between unary automata. STACS 1998, LNCS 1373, 1998, pp. 139-149.
9. Mereghetti, C. and Pighizzini, G. Unary automata simulations and cyclic languages. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, 1999, pp. 145-153.
10. Meyer, A. R. and Fischer, M. J. Economy of description by automata, grammars, and formal systems. IEEE Symposium SWAT 1971, pp. 188-191.
11. Salomaa, K. and Yu, S. NFA to DFA transformation for finite languages over arbitrary alphabets. J. Aut., Lang. and Comb. 2 (1997), 177-186.
12. Yu, S. Regular languages. In Rozenberg, G. and Salomaa, A. (eds.), Handbook of Formal Languages I. Springer, 1997, chapter 2, pp. 41-110.
13. Yu, S. State complexity of regular languages. J. Aut., Lang. and Comb. 6 (2001), 221-234.
14. Yu, S. and Zhuang, Q. On the state complexity of intersection of regular languages. SIGACT News 22.3 (1991), 52-54.
15. Yu, S., Zhuāng, Q., and Salomaa, K. The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125 (1994), 315-328.