The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
Introduction to the Theory of Computation
Introduction to the Theory of Computation
On the state complexity of reversals of regular languages
Theoretical Computer Science
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Finite automata and their decision problems
IBM Journal of Research and Development
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Quotient complexity of ideal languages
Theoretical Computer Science
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
| Hi-index | 5.23 |
We present binary deterministic finite automata of n states that meet the upper bound 2^n on the state complexity of reversal. The automata have a single final state and are one-cycle-free-path automata; thus the witness languages are deterministic union-free languages. This result allows us to describe a binary language such that the nondeterministic state complexity of the language and of its complement is n and n+1, respectively, while the state complexity of the language is 2^n. Next, we show that if the nondeterministic state complexity of a language and of its complement is n, then the state complexity of the language cannot be 2^n. We also provide lower and upper bounds on the state complexity of such a language.