Two graphs: Resolving the periodic reversibility of one-dimensional finite cellular automata
Authors:
- Chen WangCWChen Wang
- Junchi MaJMJunchi Ma
- Chao WangCWChao Wang
- Defu LinDLDefu Lin
- Weilin ChenWCWeilin Chen
- 1 November 2024
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 489
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Zhanjiang Science and Technology Bureau
- Tianjin Municipal Science and Technology Bureau (21JCYBJC00210)
This publication has 14 references indexed in Scilit:
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditionsTheoretical Computer Science, 2024
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata overInformation Sciences, 2022
- Quantum cellular automata and quantum field theory in two spatial dimensionsPhysical Review A, 2020
- Frobenius Coin-Exchange Generating FunctionsThe American Mathematical Monthly, 2020
- Reversibility of general 1D linear cellular automata over the binary fieldunder null boundary conditionsInformation Sciences, 2015
- Reversibility and surjectivity problems of cellular automataJournal of Computer and System Sciences, 1994
- Reversibility of 2D cellular automata is undecidablePhysica D: Nonlinear Phenomena, 1990
- Invertible cellular automata: A reviewPhysica D: Nonlinear Phenomena, 1990
- Some clarifications of the concept of a Garden-of-Eden configurationJournal of Computer and System Sciences, 1975
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structuresJournal of Computer and System Sciences, 1972