Canonical automata via distributive law homomorphisms

@inproceedings{Zetzsche2021CanonicalAV,
  title={Canonical automata via distributive law homomorphisms},
  author={Stefan Zetzsche and Gerco van Heerdt and Alexandra Silva and Matteo Sammartino},
  booktitle={MFPS},
  year={2021}
}
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset construction has been lifted to a more general framework that converts an automaton with side-effects, given by a monad, into a deterministic automaton accepting the same language. The resulting automaton has additional algebraic properties, both in the state space and transition structure, inherited from the monad. In… 
Generators and bases for algebras over a monad
TLDR
This paper uses the general notion of generators and bases for algebras over arbitrary monads on arbitrary categories in the context of coalgebraic systems and shows that a generator for the underlying algebra of a bialgebra gives rise to an equivalent free bial algebra.
Weakening and Iterating Laws using String Diagrams
Distributive laws are a standard way of combining two monads, providing a compositional approach for reasoning about computational effects in semantics. Situations where no such law exists can

References

SHOWING 1-10 OF 75 REFERENCES
Generalizing determinization from automata to coalgebras
TLDR
This paper lifts the powerset construction from automata to the more general framework of coal- gebras with structured state spaces and shows how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready semantics.
Coalgebraic constructions of canonical nondeterministic automata
A (co)algebraic theory of succinct automata
Generalizing the powerset construction, coalgebraically
TLDR
The powerset construction on automata is lifted to the more general framework of coalgebras with structured state spaces and its applications include partial Mealy machines, (structured) Moore automata, and Rabin probabilistic automata.
Bases for algebras over a monad
TLDR
It is shown that the notion of a basis can be extended to algebras of arbitrary monads on arbitrary categories and is able to recover known constructions from automata theory, namely the so-called canonical residual finite state automaton.
A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
  • B. Jacobs
  • Computer Science
    Essays Dedicated to Joseph A. Goguen
  • 2006
TLDR
This papers reviews the classical theory of deterministic automata and regular languages from a categorical perspective and suggests that this situation is paradigmatic for (theoretical) computer science as the study of “generated behaviour”.
A Bialgebraic Review of Regular Expressions, Deterministic Automata and Languages
TLDR
This papers reviews the classical theory of deterministic automata and regular languages from a categorical perspective and suggests that this situation is paradigmatic for (theoretical) computer science as the study o f "generated behaviour" .
Residual Finite State Automata
TLDR
It is proved that every regular language is recognized by a unique (canonical) RFSA which has a minimal number of states and a maximal number of transitions.
Theory of átomata
Efficient Equivalence and Minimization for Non Deterministic Xor Automata
TLDR
A cubic time algorithm is presented to reduce a xor-automaton to a minimal form M = MXA(A), within the least possible number of states, a finite strong normal form and automata equivalence is efficiently decided through reduction to the SNF.
...
...