Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641)
From MaRDI portal
scientific article; zbMATH DE number 7810504
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) |
scientific article; zbMATH DE number 7810504 |
Statements
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (English)
0 references
28 February 2024
0 references
cellular automata
0 references
reversibility
0 references
linear rule
0 references
null boundary
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
