Distinct cellular-automata classes over the integers and the free group
Statement
Let be an alphabet, let be the infinite cyclic group, and let be the free group on two generators. Write for the class of cellular automata over alphabet with tessellation group . Cellular-automata class inequality. One has
The paper notes that the analogous inequality is known for finite cellular automata with alphabet , while the corresponding assertion for the full cellular-automata classes had not been established there.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.