State Complexity of Overlap Assembly

Janusz Brzozowski, Lila Kari, Bai Li +1

The \emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a reg…