Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata

DOI10.1007/978-3-319-44365-2_5zbMath1392.68277OpenAlexW2513065519MaRDI QIDQ4571169

Kenichi Morita

Publication date: 6 July 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44365-2_5

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Logical Gates via Gliders Collisions ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Unnamed Item ⋮ Reversible elementary triangular partitioned cellular automata and their complex behavior

Cites Work

• Conservative logic
• Computation and construction universality of reversible cellular automata
• A computation-universal two-dimensional 8-state triangular reversible cellular automaton
• An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata