Related papers: The semibicategory of Moore automata
A conjecture of May states that there is an up-to-adjunction strictification of symmetric bimonoidal functors between bipermutative categories. The main result of this paper proves a weaker form of May's conjecture that starts with…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…
In this paper, we study some large scale properties of the mother groups of bounded automata groups. First we give two methods to prove every mother group has infinite asymptotic dimension. Then we study the decomposition complexity of…
The topological and metrical equivalence of fractals is an important topic in analysis. In this paper, we use a class of finite state automata, called $\Sigma$-automaton, to construct psuedo-metric spaces, and then apply them to the study…
We construct a left semi-model category of "marked strict $\infty$-categories" for which the fibrant objects are those whose marked arrows satisfy natural closure properties and are weakly invertible. The canonical model structure on strict…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…
This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper…
We start with comparisons of hierarchies in Biology and relate it to Quan- tum Field Theories. Thereby we discover many similarities and translate them into rich mathematical correspondences. The basic connection goes via scale…
We describe the class of semi-stable model categories, which generalize the equivalence of finite products and coproducts in abelian and stable model categories, and use this to establish Morita equivalences among categories of functors. We…
A stable $\infty$-category is $1$-semiadditive if the norms for all finite group actions are equivalences. In the presence of $1$-semiadditivity, Goodwillie calculus simplifies drastically. We introduce two variants of $1$-semiadditivity…
Bifurcations of periodic orbits as an external parameter is varied are a characteristic feature of generic Hamiltonian systems. Meyer's classification of normal forms provides a powerful tool to understand the structure of phase space…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…
In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-Pell compositions and semi-$m$-Pell compositions. We find that these are in bijection with certain weakly unimodal $m$-ary compositions. We give…
Semibiproducts of monoids are introduced here as a common generalization to biproducts (of abelian groups) and to semidirect products (of groups) for exploring a wide class of monoid extensions. More generally, abstract semibiproducts exist…
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 reconcile the two different category-theoretic semantics of regular theories in predicate logic. A 2-category of `regular fibrations' is constructed, as well as a 2-category of `regular proarrow equipments', and it is shown that the two…
These lecture notes are intended as a supplement to Moore and Mertens' The Nature of Computation or as a standalone resource, and are available to anyone who wants to use them. Comments are welcome, and please let me know if you use these…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important and universal in mathematics---with adjunctions being the primary lense. If adjunctions are so important in mathematics,…