CoLoSS: The Coalgebraic Logic Satisfiability Solver. - Georgel Calin; Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (M4M, 2007)

Coalgebraic Expressions. - Robert S. R. Myers (FICS, 2009)

Coalgebraic Hybrid Logic. - Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (FoSSaCS, 2009)

Hybrid logic with the difference modality for generalisations of graphs. - Robert S. R. Myers; Dirk Pattinson (J. Appl. Log., 2010)

A Characterisation of NL/poly via Nondeterministic Finite Automata. - Robert S. R. Myers; Henning Urbat (DCFS, 2013)

Rational Operational Models. - Stefan Milius; Marcello M. Bonsangue; Robert S. R. Myers; Jurriaan Rot (MFPS, 2013)

Canonical Nondeterministic Automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (CMCS, 2014)

Generalized Eilenberg Theorem I: Local Varieties of Languages. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (FoSSaCS, 2014)

On Continuous Nondeterminism and State Minimality. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (MFPS, 2014)

Varieties of Languages in a Category. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (LICS, 2015)

Coalgebraic constructions of canonical nondeterministic automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (Theor. Comput. Sci., 2015)

Generalized Eilenberg Theorem: Varieties of Languages in a Category. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (ACM Trans. Comput. Log., 2019)

Nondeterministic Automata and JSL-dfas. - Robert Samuel Ralph Myers (CoRR, 2020)

Nondeterministic Syntactic Complexity. - Robert S. R. Myers; Stefan Milius; Henning Urbat (FoSSaCS, 2021)

Syntactic Minimization Of Nondeterministic Finite Automata. - Robert S. R. Myers; Henning Urbat (MFCS, 2021)