Related papers: The semibicategory of Moore automata
We consider certain categorical structures that are implicit in subfactor theory. Making the connection between subfactor theory (at finite index) and category theory explicit sheds light on both subjects. Furthermore, it allows various…
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results…
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…
Constant Rank (CR) state machines play an important role in the general structure theory of Finite State Machines. A machine is of constant rank if each input and input-sequence maps the state set onto the same number of next states.…
In this article, the author analyses distributive and mixed distributive laws and some of their equivalences through the use of 2-adjunctions of the type $\Adj$-$\Mnd$. As far as the distributive laws are concerned, the equivalence between…
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…
The monomorphism category $\mathscr{S}(A, M, B)$ induced by a bimodule $_AM_B$ is the subcategory of $\Lambda$-mod consisting of $\left[\begin{smallmatrix} X\\ Y\end{smallmatrix}\right]_{\phi}$ such that $\phi: M\otimes_B Y\rightarrow X$ is…
This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…
From the viewpoint of higher homological algebra, we introduce pure semisimple $n$-abelian category, which is analogs of pure semisimple abelian category. Let $\Lambda$ be an Artin algebra and $\mathcal{M}$ be an $n$-cluster tilting…
We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
Erratum, 11 July 2022: This is an updated version of the original paper in which the notion of reparametrization category was incorrectly axiomatized. Details on the changes to the original paper are provided in the Appendix. A…
Pin proved that every circular automaton with a prime number of states containing a non-permutation is synchronizing. In this paper, we investigate the synchronization of circular semi-flower automata. We first prove that every semi-flower…
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…
The Mutual Reinforcement Effect (MRE) investigates the synergistic relationship between word-level and text-level classifications in text classification tasks. It posits that the performance of both classification levels can be mutually…
In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…
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…