Abstract
We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This result follows from
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have