相关论文: The Myhill property for cellular automata on amena…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…
We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite…
We fix a path model for the space of filters of the inverse semigroup $\mathcal{S}_\Lambda$ associated to a left cancellative small category $\Lambda$. Then, we compute its tight groupoid, thus giving a representation of its $C^*$-algebra…
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…
Given a semigroup S with zero, which is left-cancellative in the sense that st=sr \neq 0 implies that t=r, we construct an inverse semigroup called the inverse hull of S, denoted H(S). When S admits least common multiples, in a precise…
We extend the concept of amenability of a Banach algebra $A$ to the case that there is an extra $\mathfrak A$-module structure on $A$, and show that when $S$ is an inverse semigroup with subsemigroup $E$ of idempotents, then $A=\ell^1(S)$…
In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The…
We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean dimension is established for (near) strongly permutative, permutative algebraic and unit…
If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum…
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at…
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…
We completely determine all commutative semigroup varieties that are cancellable elements of the lattice SEM of all semigroup varieties. In particular, we prove that, for commutative varieties, the properties of being cancellable and…
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…
We give lower bounds for the electrical resistance between vertices in the Schreier graphs of the action of the linear (degree 1) and quadratic (degree 2) mother groups on the orbit of the zero ray. These bounds, combined with results of…
For the first time a mathematical object is presented - a reversible cellular Automaton - with many paradoxical qualities, the main ones among them are: a frequent quickly return to its original state, the presence of a large number of…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
We construct reduced and full semigroup C*-algebras for left cancellative semigroups. Our new construction covers particular cases already considered by A. Nica and also Toeplitz algebras attached to rings of integers in number fields due…
We show that if E is a Frechet G\rtimes S(M)-module, for which the canonical map from the projective completion G\rtimes S(M) {\widehat \otimes} E to E is surjective, then every element of E can be written as a finite sum of elements of the…
For an inverse semigroup S with the set of idempotents E and a minimal idempotent, we find necessary and sufficient conditions for the Fourier algebra A(S) to be module amenable, module character amenable, module (operator) biflat, or…