Inverse rules of ECA with rule number 150

DOI10.1016/j.amc.2006.12.058zbMath1123.68075OpenAlexW1537060455MaRDI QIDQ2383699

Yanyan Li

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.12.058

zbMATH Keywords

cellular automataperiodic boundary conditionsreversibilitytransition polynomial150 elementary cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (19)

Error correcting codes via reversible cellular automata over finite fields ⋮ Ternary reversible number-conserving cellular automata are trivial ⋮ Reversibility problem of multidimensional finite cellular automata ⋮ SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice ⋮ Structure and reversibility of 2D hexagonal cellular automata ⋮ Virtual cyclic cellular automata, finite group actions and recursive properties ⋮ Unnamed Item ⋮ 2D Triangular von Neumann Cellular Automata with Periodic Boundary ⋮ The reversibility problem for a family of two-dimensional cellular automata ⋮ Block invariance and reversibility of one dimensional linear cellular automata ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ Reversibility of linear cellular automata on Cayley trees with periodic boundary condition ⋮ Reversibility of linear cellular automata ⋮ A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule ⋮ Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\) ⋮ REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES ⋮ Characterization of reversible intermediate boundary cellular automata

Cites Work

• Invertible cellular automata: A review
• Computation-universality of one-dimensional one-way reversible cellular automata
• Procedures for calculating reversible one-dimensional cellular automata
• Efficient exhaustive listings of reversible one dimensional cellular automata
• On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
• The complexity of reversible cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Matrix methods and local properties of reversible one-dimensional cellular automata
• On reversibility of cellular automata with periodic boundary conditions
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Inverse rules of ECA with rule number 150