Hybrid one-dimensional reversible cellular automata are regular

DOI10.1016/j.dam.2007.07.003zbMath1130.68076OpenAlexW2092383642MaRDI QIDQ2462395

Jesse Bingham, B. D. Bingham

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

zbMATH Keywords

regular languagefinite state automatonhybrid cellular automatonreversible cellular automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (2)

Glider Collisions in Hybrid Cellular Automaton with Memory Rule (43,74) ⋮ BLOCK TRANSFORMATION OF HYBRID CELLULAR AUTOMATA

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid one-dimensional reversible cellular automata are regular