50 citations · 69 across the 17 of their papers we have counts for
1 paper · 2 filters
Daniel Berend, Aryeh Kontorovich
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 o…