Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Formal languages
A maxmin problem on finite automata
Discrete Applied Mathematics
Process algebra
Splicing semigroups of dominoes and DNA
Discrete Mathematics
On the state complexity of intersection of regular languages
ACM SIGACT News
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Theory of Automata
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
On the average state and transition complexity of finite languages
Theoretical Computer Science
State-complexity hierarchies of uniform languages of alphabet-size length
Theoretical Computer Science
| Hi-index | 0.00 |
A measure of the complexity of a regular language L is the number of states in the smallest DFA accepting L. We study this quantity in the case of finite languages over a non-unary alphabet. We compute the maximum number of states of a minimal deterministic finite automaton (DFA) recognizing words of length less than or equal to some given integer. We also compute the maximum number of states of a minimal complete DFA that accepts only words of length equal to a given integer. For both cases, we prove that the upper bound can be reached by an explicit construction of a DFA, and we compute the asymptotic behavior of the upper bound.