Strong Transitivity of Group Cellular Automata: Characterization and Decidability
cs.DM, cs.FL, math.DS
Submitted: 2026-11-17
Updated: 2026-11-17
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns