Efficient exhaustive listings of reversible one dimensional cellular automata
From MaRDI portal
Publication:1884849
DOI10.1016/j.tcs.2004.06.007zbMath1071.68065OpenAlexW2045413404WikidataQ56621429 ScholiaQ56621429MaRDI QIDQ1884849
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.007
Algebraic modelsOrderly algorithmExhaustive enumerationGraph modelsOne-dimensional cellular automata
Related Items
Inverse rules of ECA with rule number 150, Partial Reversibility of One-Dimensional Cellular Automata, UNCONVENTIONAL INVERTIBLE BEHAVIORS IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA, Orderly algorithm to enumerate central groupoids and their graphs, Rectangular groupoids and related structures, Graphs with the unique path property: Structure, cycles, factors, and constructions, Reversible computing and cellular automata -- a survey, Procedures for calculating reversible one-dimensional cellular automata, Welch sets for random generation and representation of reversible one-dimensional cellular automata
Uses Software
Cites Work
- On rational circulants satisfying \(A^ m=dI+\lambda J\)
- Reversibility of 2D cellular automata is undecidable
- Invertible cellular automata: A review
- Extraction of mth roots in matrix rings over fields
- Quasilinear cellular automata
- On the matrix equation \(A^m=\lambda J\)
- On the \(g\)-circulant solutions to the matrix equation \(A^m=\lambda J\)
- Algebraic properties of linear cellular automata
- The structure of reversible one-dimensional cellular automata
- On rational circulants satisfying \(A^2=dI+\lambda J\)
- On some solutions of \(A^k=dI+\lambda J\)
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones
- On the existence of finite central groupoids of all possible ranks. I
- An orderly algorithm and some applications in finite geometry
- \(L\)-groupoids: Algebraic and topological properties of special groupoids
- A generalization of the matrix equation \(A^ 2=J\)
- Parallelism in near-rings
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Isomorph-Free Exhaustive Generation
- Generative communication in Linda
- Notes on central groupoids
- Products of Points--Some Simple Algebras and their Identities
- Logical Reversibility of Computation
- Idempotent Semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
