19 citations · 121 across the 33 of their papers we have counts for
Showing 2017 · cs.FLShow all
3 papers · 2 filters
cs.FL2017
State Complexity of Overlap Assembly
Janusz Brzozowski, Lila Kari, Bai Li +1
The \emph{state complexity} of a regular language is the number of states in a minimal deterministic finite automaton (DFA) accepting . The state complexity of a reg…
cs.FL2017
Towards a Theory of Complexity of Regular Languages
Janusz A. Brzozowski
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the la…
cs.FL2017
Most Complex Non-Returning Regular Languages
Janusz A. Brzozowski, Sylvie Davies
A regular language is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derive…