On von Neumann regularity of cellular automata

  title={On von Neumann regularity of cellular automata},
  author={Ville Salo},
  • V. Salo
  • Published 27 September 2022
  • Mathematics
  • ArXiv
We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic shifts and block maps. It follows from previous joint work of the author and Törmä that von Neumann regularity is a decidable condition, and we decide it for all elementary CA, obtaining the optimal radii for weak generalized inverses. Two sufficient… 

Figures and Tables from this paper



On the conjugacy problem of cellular automata

Elementary, Finite and Linear vN-Regular Cellular Automata

Reversibility and Surjectivity Problems of Cellular Automata

  • J. Kari
  • Mathematics
    J. Comput. Syst. Sci.
  • 1994

Statistical mechanics of cellular automata

Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.

Cellular Automata and Groups

Theorem: Finitely Generated Amenable Groups + Local Embeddability and Sofic Groups + Uniform Structures + Complements of Functional Analysis + Ultrafilters = 6.


SUMMARY. Sofic groups were first defined by M. Gromov as a common generalization of amenable groups and residually finite groups. We discuss this new class and especially its relationship to an old

Lower entropy factors of sofic systems

  • Mike Boyle
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 1983
Abstract A mixing subshift of finite type T is a factor of a sofic shift S of greater entropy if and only if the period of any periodic point of S is divisible by the period of some periodic point of

∞-Categories for the Working Mathematician

homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition,

Introduction to automata theory, languages, and computation, 2nd edition

The introduction to formal languages and automata wasolutionary rather than rcvolrrtionary and addressed Initially, I felt that giving solutions to exercises was undesirable hecause it lirrritcd the Chapter 1 fntroduction to the Theory of Computation.

Category theory of symbolic dynamics