Finite automata and unary languages
Theoretical Computer Science
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
The state complexity of * L and its connection with temporal logic
Information Processing Letters
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Finite automata and their decision problems
IBM Journal of Research and Development
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the State Complexity of Scattered Substrings and Superstrings
Fundamenta Informaticae
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
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 star of union and square of union on k regular languages
Theoretical Computer Science
| Hi-index | 0.90 |
We show that if M is a DFA with n states over an alphabet with at least two letters and L=L(M), then the worst-case state complexity of L^2 is n2^n-2^n^-^1. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of L^k is kn-k+1 for all k=2.