Related papers: Automata in toposes, and general Myhill-Nerode the…
We consider topological groupoids in finite and also in a compact settings. In the initial sections, we introduce definitions of typical observables and we studied them in the context of statistical mechanics and quantum mechanics. We…
For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^G\to A$ and then we show that it is naturally isomorphic to the monoid of cellular automata $\mathrm{CA}(G,…
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
We investigate the transition monoid construction for deterministic automata in a categorical setting and establish it as an adjunction. We pair this adjunction with two other adjunctions to obtain two endofunctors on deterministic…
We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of…
We consider asynchronous networks of identical finite (independent of network's size or topology) automata. Our automata drive any network from any initial configuration of states, to a coherent one in which it can carry efficiently any…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…
We provide theorems containnig both Kakutani and Browder fixed points theorems as immediate corollaries, as well as Michael and Browder selection theorems. For this purpose we introduce convex structures more general than those of locally…
We develop a rigidity criterion to show that in simplicial model categories with a compatible symmetric monoidal structure, operad structures can be automatically lifted along certain maps. This is applied to obtain an unpublished result of…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
We show that Nichols algebras of most simple Yetter-Drinfeld modules over the projective special linear group over a finite field, corresponding to non-semisimple orbits, have infinite dimension. We spell out a new criterium to show that a…
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…
We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To…
We illustrate a completely analytic approach to Mel'nikov theory, which is based on a suitable extension of a classical method, and which is parallel and -- at least in part -- complementary to the standard procedure. This approach can be…
In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…
We review topics in the theory of cellular automata and dynamical systems that are related to the Moore-Myhill Garden of Eden theorem.
Any finite state automaton gives rise to a Boolean one-dimensional TQFT with defects and inner endpoints of cobordisms. This paper extends the correspondence to Boolean TQFTs where defects accumulate toward inner endpoints, relating such…
We extend Krasnoselskii's fixed point result to non-self-real functions. We find a new and simple proof for Hillam's result. In our approach, we don't assume the image of the related mapping to be compact or bounded. In this way, we extend…