相关论文: Bicategories of Automata, Automata in Bicategories

We study the semibicategory $\textsf{Mre}$ 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…

We study monads in the (pseudo-)double category $\mathbf{KSW}(\mathcal{K})$ where loose arrows are Mealy automata valued in an ambient monoidal category $\mathcal{K}$, and the category of tight arrows is $\mathcal{K}$. Such monads turn out…

We present a slick proof of completeness and cocompleteness for categories of $F$-automata, where the span of maps $E\leftarrow E\otimes I \to O$ that usually defines a deterministic automaton of input $I$ and output $O$ in a monoidal…

This paper studies the Euler characteristic of a bicategory based on the concept of magnitudes introduced by Leinster. We focus on its invariance with respect to biequivalence and on the product formula for Buckley's fibered bicategories.

The notion of cartesian bicategory, introduced by Carboni and Walters for locally ordered bicategories, is extended to general bicategories. It is shown that a cartesian bicategory is a symmetric monoidal bicategory.

We develop further the theory of operads and analytic functors. In particular, we introduce a bicategory that has operads as 0-cells, operad bimodules as 1-cells and operad bimodule maps as 2-cells, and prove that this bicategory is…

We define a bicategory $\mathbf{2TDX}$ whose 1-cells provide a categorification of transducers, computational devices extending finite-state automata with output capabilities. This bicategory is a mathematically interesting object: its…

The universal property for the B\'enabou bicategory of distributors (although we call them "modules") presented here is somewhat implicitly spread over a series of papers and yet, to my knowledge, does not appear in print. The inclusion of…

In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…

We characterize in terms of bicategories actions of monoidal categories to representation categories of algebras. For that purpose we introduce cocycles in any 2-category $\K$ and the category of Tambara modules over a monad $B$ in $\K$. We…

We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…

Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work we study categorical dualities, which are defined as bounded-spread…

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

This paper proposes a generalized framework for cellular automata using the language of category theory, extending the classical definition beyond set-theoretic constraints. For an arbitrary category $\mathscr{C}$ with products, we define…

The bicategory of normal functors between W*-categories is monoidally equivalent to the bicategory of W*-bimodules.

We introduce Turaev bicategories and Turaev pseudofunctors. On the one hand, they generalize the notions of Turaev categories (and Turaev functors), introduced at the turn of the millennium and originally called "crossed group categories"…

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…

We show that the regular patterns of Getzler (2009) form a 2-category biequivalent to the 2-category of substitudes of Day and Street (2003), and that the Feynman categories of Kaufmann and Ward (2013) form a 2-category biequivalent to the…

In this article we review the theory of anafunctors introduced by Makkai and Bartels, and show that given a subcanonical site S, one can form a bicategorical localisation of various 2-categories of internal categories or groupoids at weak…