Real-time recognition of languages on an two-dimensional Archimedean thread

DOI10.1016/J.TCS.2004.03.016zbMath1068.68086OpenAlexW1980271418MaRDI QIDQ1885922

Yanyan Li

Publication date: 12 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.016

zbMATH Keywords

ComplexityCellular automataReal timeLanguage recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80)

Related Items (2)

Closure properties of cellular automata ⋮ Low complexity classes of multidimensional cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Signals in one-dimensional cellular automata
• Two-dimensional cellular automata recognizer
• Parallel recognition of rational languages in plane cellular automata
• Real-time language recognition by one-dimensional cellular automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

This page was built for publication: Real-time recognition of languages on an two-dimensional Archimedean thread