Operational State Complexity under Parikh Equivalence
We investigate, under Parikh equivalence, the state complexity of some language operations which preserve regularity. For union, concatenation, Kleene star, complement, intersection, shuffle, and reversal, we obtain a polynomial state complexity over any fixed alphabet, in contrast to the intrinsic exponential state complexity of some of these operations in the classical version. For projection we prove a superpolynomial state complexity, which is lower than the exponential one of the corresponding classical operation. We also prove that for each two deterministic automata A and B it is possible to obtain a deterministic automaton with a polynomial number of states whose accepted language has as Parikh image the intersection of the Parikh images of the languages accepted by A and B. Finally, we prove that for each finite set there exists a small context-free grammar defining a language with the same Parikh image.
Keywordsstate complexity regular languages Parikh equivalence context-free grammars semilinear sets
Unable to display preview. Download preview PDF.
- 8.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
- 15.To, A.W.: Model Checking Infinite-State Systems: Generic and Specific Approaches. Ph.D. thesis, School of Informatics, University of Edinburgh (August 2010)Google Scholar
- 17.Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6, 221–234 (2000)Google Scholar