11 citations · 15 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021
Syntactic Minimization of Nondeterministic Finite Automata
Robert Samuel Ralph Myers, Henning Urbat
Nondeterministic automata may be viewed as succinct programs implementing deterministic automata, i.e. complete specifications. Converting a given deterministic automaton into a sm…
cs.FL2021
Nondeterministic Syntactic Complexity
Robert Myers, Stefan Milius, Henning Urbat
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of t…