State Complexity of Basic Operations on Nondeterministic Finite Automata

@inproceedings{Holzer2002StateCO,
  title={State Complexity of Basic Operations on Nondeterministic Finite Automata},
  author={Markus Holzer and Martin Kutrib},
  booktitle={CIAA},
  year={2002}
}
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… CONTINUE READING