State Complexity of Basic Operations on Nondeterministic Finite Automata
The state complexities of basic operations on nondeterministic finite automata (NFA) are investigated. In particular, we consider Boolean operations, catenation operations - concatenation, iteration, λ- free iteration - and the reversal on NFAs that accept finite and infinite languages over arbitrary alphabets. Most of the shown bounds are tight in the exact number of states, i.e. the number is sufficient and necessary in the worst case. For the complementation tight bounds in the order of magnitude are proved. It turns out that the state complexities of operations on NFAs and deterministic .nite automata (DFA) are quite different. For example, the reversal and concatenation have exponential state complexity on DFAs but linear complexity on NFAs. Conversely, the complementation can be done with linear complexity on DFAs but needs exponentially many states on NFAs.
Unable to display preview. Download preview PDF.
- 1.Câmpeanu, C., Čulik, K., Salomaa, K., and Yu, S. State complexity of basic operations on.nite languages. Fourth International Workshop on Implementing Automata, LNCS 2214, pp. 60–70.Google Scholar
- 5.Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.Google Scholar
- 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.Google Scholar
- 10.Meyer, A. R. and Fischer, M. J. Economy of description by automata, grammars, and formal systems. IEEE Symposium SWAT 1971, pp. 188–191.Google Scholar
- 12.Yu, S. Regular languages. In Rozenberg, G. and Salomaa, A. (eds.), Handbook of Formal Languages I. Springer, 1997, chapter 2, pp. 41–110.Google Scholar