A maxmin problem on finite automata
Discrete Applied Mathematics
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
Concrete Math
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
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
Theoretical Computer Science - Descriptional complexity of formal systems
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Enumeration and random generation of accessible automata
Theoretical Computer Science
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
NFAs with and without ε-transitions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hi-index | 5.23 |
We investigate the average-case state and transition complexity of deterministic and nondeterministic finite automata, when choosing a finite language of a certain ''size'' n uniformly at random from all finite languages of that particular size. Here size means that all words of the language are either of length n, or of length at most n. It is shown that almost all deterministic finite automata accepting finite languages over a binary input alphabet have state complexity @Q(2^nn), while nondeterministic finite automata are shown to perform better, namely the nondeterministic state complexity is in @Q(2^n). Interestingly, in both cases the aforementioned bounds are asymptotically like in the worst case. However, the nondeterministic transition complexity is shown to be again @Q(2^nn). The case of unary finite languages is also considered. Moreover, we develop a framework that allows us to investigate the average-case complexity of operations like, e.g., union, intersection, complementation, and reversal, on finite languages in this setup.