Two-dimensional cellular automata and deterministic on-line tessalation automata
From MaRDI portal
Publication:1399986
DOI10.1016/S0304-3975(02)00575-3zbMath1022.68083MaRDI QIDQ1399986
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Closure properties of cellular automata ⋮ Inductive definitions in logic versus programs of real-time cellular automata
Cites Work
- Unnamed Item
- On real-time cellular automata and trellis automata
- Relating the power of cellular arrays to their closure properties
- A linear speed-up theorem for cellular automata
- Some properties of two-dimensional on-line tessellation acceptors
- Signals in one-dimensional cellular automata
- Two-dimensional cellular automata recognizer
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation
This page was built for publication: Two-dimensional cellular automata and deterministic on-line tessalation automata
