Two-dimensional cellular automata recognizer

DOI10.1016/S0304-3975(98)00329-6zbMath0916.68137MaRDI QIDQ1292301

Véronique Terrier

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

language recognizer

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80)

Related Items (8)

Closure properties of cellular automata ⋮ Two-dimensional cellular automata and their neighborhoods ⋮ Real-time recognition of languages on an two-dimensional Archimedean thread ⋮ Constant Acceleration Theorem for Extended von Neumann Neighbourhoods ⋮ Two-dimensional cellular automata and deterministic on-line tessalation automata ⋮ Inductive definitions in logic versus programs of real-time cellular automata ⋮ Asynchronous communicating cellular automata: formalization, robustness and equivalence ⋮ Parallel recognition of rational languages in plane cellular automata

Cites Work

• Reversibility of 2D cellular automata is undecidable
• Two-dimensional iterative arrays: Characterizations and applications
• A linear speed-up theorem for cellular automata
• Some properties of two-dimensional on-line tessellation acceptors
• Language not recognizable in real time by one-way cellular automata
• Simulations between cellular automata on Cayley graphs
• Real-time language recognition by one-dimensional cellular automata
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

This page was built for publication: Two-dimensional cellular automata recognizer