39 citations · 116 across the 19 of their papers we have counts for
1 paper · 2 filters
Janusz Brzozowski, Lila Kari, Bai Li +1
The \emph{state complexity} of a regular language Lm is the number m of states in a minimal deterministic finite automaton (DFA) accepting Lm. The state complexity of a reg…