When do lazy and invertible cellular automata generate all cellular automata?
math.GR, math.DS, nlin.CG
Submitted: 2026-10-13
Updated: 2026-10-31
Terminology
Related papers
- Idempotence criteria for lazy cellular automata
- From algebraic orthogonality to RAAG embedding obstructions in hierarchically hyperbolic groups
- A finitely generated Linear group without property (T) that is neither inner amenable nor properly proximal
- From almost tight p-group enumeration to 2-group domination among finite groups
- Character Nonvanishing under Coprime Actions
- Dyer groups have the falsification by fellow-traveller property