Related papers: Basic properties for sand automata
Determining whether a dynamical system is integrable is generally a difficult task which is currently done on a case by case basis requiring large human input. Here we propose and test an automated method to search for the existence of…
We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…
We construct a one-dimensional uniquely ergodic cellular automaton which is not nilpotent. This automaton can perform asymptotically infinitely sparse computation, which nevertheless never disappears completely. The construction builds on…
We prove that a polynomial Julia set which is a finitely irreducible continuum is either an arc or an indecomposable continuum. For the more general case of rational functions, we give a topological model for the dynamics when the Julia set…
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…
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable…
The main purpose of this paper is investigating classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of…
A certain class of integrable hydrodynamic type systems with three independent and N dependent variables is considered. We choose the existence of a pseudopotential as a criterion of integrability. It turns out that the class of integrable…
We provide a nilpotency criterion for fusion systems in terms of the vanishing of its cohomology with twisted coefficients.
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.
Fuzzy automata have long been accepted as a generalization of nondeterministic finite automata. A closer examination, however, shows that the fundamental property---nondeterminism---in nondeterministic finite automata has not been well…
We exhibit a new proof, relying on bivariant theory, that the nilpotent cone is rationally smooth. Our approach enables us to prove a slightly more general statement.
We study generalized permutohedra and supermodular functions. Specifically we analyze decomposability and irreducibility for these objects and establish some asymptotic behavior. We also study a related problem on irreducibility for…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to…
We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the…
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.
Let $\Gamma$ be a group of type rotating automorphisms of a building $\cB$ of type $\widetilde A_2$, and suppose that $\Gamma$ acts freely and transitively on the vertex set of $\cB$. The apartments of $\cB$ are tiled by triangles, labelled…