Intersection and union of regular languages and state complexity
Information Processing Letters
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of Formal Languages
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
The state complexity of L2 and Lk
Information Processing Letters
State complexity of combined operations
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of basic language operations combined with reversal
Information and Computation
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of operations on two-way deterministic finite automata over a unary alphabet
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of combined operations with two basic operations
Theoretical Computer Science
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
On the State Complexity of Star of Union and Star of Intersection
Fundamenta Informaticae
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
State complexity of star and square of union of k regular languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
Hi-index | 5.23 |
The number of states in a deterministic finite automaton (DFA) recognizing the language L^k, where L is regular language recognized by an n-state DFA, and k=2 is a constant, is shown to be at most n2^(^k^-^1^)^n and at least (n-k)2^(^k^-^1^)^(^n^-^k^) in the worst case, for every nk and for every alphabet of at least six letters. Thus, the state complexity of L^k is @Q(n2^(^k^-^1^)^n). In the case k=3 the corresponding state complexity function for L^3 is determined as 6n-384^n-(n-1)2^n-n with the lower bound witnessed by automata over a four-letter alphabet. The nondeterministic state complexity of L^k is demonstrated to be nk. This bound is shown to be tight over a two-letter alphabet.