A Survey on Operational State Complexity [article]

Yuan Gao and Nelma Moreira and Rogério Reis and Sheng Yu
2015 arXiv   pre-print
Descriptional complexity is the study of the conciseness of the various models representing formal languages. The state complexity of a regular language is the size, measured by the number of states of the smallest, either deterministic or nondeterministic, finite automaton that recognises it. Operational state complexity is the study of the state complexity of operations over languages. In this survey, we review the state complexities of individual regularity preserving language operations on
more » ... egular and some subregular languages. Then we revisit the state complexities of the combination of individual operations. We also review methods of estimation and approximation of state complexity of more complex combined operations.
arXiv:1509.03254v1 fatcat:oxleg7kkvvezxoqgscdnlghzvu