Emergent Mind
The state complexity of random DFAs
(1307.0720)
Published Jul 2, 2013
in
math.PR
,
cs.FL
,
and
math.CO
Abstract
The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random $n$-state DFAs over a $k$-symbol alphabet, drawn uniformly from the set $[n]{[n]\times[k]}\times2{[n]}$ of all such automata. We show that, with high probability, the latter is $\alphak n + O(\sqrt n\log n)$ for a certain explicit constant $\alphak$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.