2 citations · 4 across the 3 of their papers we have counts for
4 papers
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…
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…
Representing Semilattices as Relations
Robert Samuel Ralph Myers
We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of 's…
Nondeterministic Automata and JSL-dfas
Robert Samuel Ralph Myers
We introduce the category of dependency automata. A dependency automaton consists of two nondeterministic finite automata, with a relation between their states satisfying condition…