11 citations · 15 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
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…
Varieties of Languages in a Category
Jiri Adamek, Stefan Milius, Robert Myers +1
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In th…
Generalized Eilenberg Theorem I: Local Varieties of Languages
Jiri Adamek, Stefan Milius, Robert Myers +1
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states th…