Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over Z_p

From MaRDI portal
Publication:6118641







Cites work









This page was built for publication: Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6118641)