Hybrid one-dimensional reversible cellular automata are regular
From MaRDI portal
Publication:2462395
DOI10.1016/j.dam.2007.07.003zbMath1130.68076MaRDI QIDQ2462395
Publication date: 30 November 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.003
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invertible cellular automata: A review
- Reversibility and surjectivity problems of cellular automata
- The set of reversible \(90/150\) cellular automata is regular
- The complexity of reversible cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Uniform Random Generation of Strings in a Context-Free Language
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem