Universal groups of cellular automata
From MaRDI portal
Abstract: We prove that the group of reversible cellular automata (RCA), on any alphabet , contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet . This result follows from a case study of groups of RCA generated by symbol permutations and partial shifts (equivalently, partitioned cellular automata) with respect to a fixed Cartesian product decomposition of the alphabet. For prime alphabets, we show that this group is virtually cyclic, and that for composite alphabets it is non-amenable. For alphabet size four, it is a linear group. For non-prime non-four alphabets, it contains copies of all finitely generated groups of RCA. We also prove this property for the group generated by RCA of biradius one on any full shift with large enough alphabet, and also for some perfect finitely generated groups of RCA.
Recommendations
- Cellular automata and groups
- A generalization of cellular automata over groups
- Groups and Monoids of Cellular Automata
- Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem
- Cellular automata, duality and sofic groups
- Group properties of nonlinear cellular automata
- Cellular automata, quasigroups and symmetries
- Characterization of a Class of Complemented Group Cellular Automata
- Machines, Computations, and Universality
- Amenable groups and cellular automata
Cites work
- A note on subgroups of automorphism groups of full shifts
- An Introduction to Symbolic Dynamics and Coding
- Automorphisms of one-sided subshifts of finite type
- Block maps between primitive uniform and Pisot substitutions
- Closed Systems of Invertible Maps
- Computing automorphism groups of shifts using atypical equivalence classes
- Distortion and the automorphism group of a shift
- Distortion in one-head machines and cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Endomorphisms of Sturmian systems and the discrete chair substitution tiling system
- Errata: Reduction of the Poincaré group with respect to the Lorentz group
- Generalized Free Products of Linear Groups
- Groups and Monoids of Cellular Automata
- Higher dimensional Thompson groups.
- scientific article; zbMATH DE number 4214929 (Why is no real title available?)
- scientific article; zbMATH DE number 5469853 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 1500511 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Introductory notes on Richard Thompson's groups
- Linear groups, conjugacy growth, and classifying spaces for families of subgroups
- No Tits alternative for cellular automata
- Normal amenable subgroups of the automorphism group of the full shift
- On amenability of automata groups.
- On automorphism groups of low complexity subshifts
- On automorphism groups of Toeplitz subshifts
- On the asynchronous rational group
- Periodic Seeded Arrays and Automorphisms of the Shift
- Periodicity and Immortality in Reversible Computing
- Representation of reversible cellular automata with block permutations
- Strongly universal reversible gate sets
- The automorphism group of a minimal shift of stretched exponential growth
- The Automorphism Group of a Shift of Finite Type
- The automorphism group of a shift of subquadratic growth
- The classification of reversible bit operations
- The group of reversible Turing machines
- The probability of generating the symmetric group
- The spacetime of a shift endomorphism
- Tits alternative for 3-manifold groups
- Toeplitz subshift whose automorphism group is not finitely generated
- Transitive action on finite points of a full shift and a finitary Ryan’s theorem
Cited in
(8)- Inducing an order on cellular automata by a grouping operation
- Universal gates with wires in a row
- No Tits alternative for cellular automata
- Post-surjectivity and balancedness of cellular automata over groups
- scientific article; zbMATH DE number 5582847 (Why is no real title available?)
- Groups and Monoids of Cellular Automata
- Gate lattices and the stabilized automorphism group
- Distortion element in the automorphism group of a full shift
This page was built for publication: Universal groups of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090173)
