The semibicategory of Moore automata

Authors Guido Boccali, Bojana Femić, Andrea Laretto, Fosco Loregiàn, Stefano Luneia

Publication date 29 April 2023

Has companion code repository https://github.com/iwilare/categorical-automata

Abstract: We study the semibicategory

e x t s f M r e

of "Moore automata": an arrangement of objects, 1- and 2-cells which is inherently and irredeemably nonunital in dimension one. Between the semibicategory of Moore automata and the better behaved bicategory

e x t s f M l y

of "Mealy automata" a plethora of adjunctions insist: the well-known essential equivalence between the two kinds of state machines that model the definitions of

e x t s f M r e

and

e x t s f M l y

is appreciated at the categorical level, as the equivalence induced between the fixpoints of an adjunction, in fact exhibiting

e x t s f M r e (A, B)

as a coreflective subcategory of

e x t s f M l y (A, B)

; the comodality induced by this adjunction is but the

0

th step of a `level-like' filtration of the bicategory

e x t s f M r e

in a countable family of essential bi-localizations

e x t s f s^{n} e x t s f M r e s u b s e t e q e x t s f M r e

. We outline a way to generate intrinsically meaningful adjunctions of this form. We mechanize some of our main results using the proof assistant Agda.

This page was built for publication: The semibicategory of Moore automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434758)