Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.

DOI10.1016/S0304-3975(03)00083-5zbMath1053.68063MaRDI QIDQ1401396

Katsunobu Imai, Jia Lee, Kenichi Morita

Publication date: 17 August 2003

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

zbMATH Keywords

Cellular automataParallel parsingUniquely parsable grammar

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Related Items (1)

Progress, gaps and obstacles in the classification of cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On real time one-way cellular array
• On real-time cellular automata and trellis automata
• Fast parallel language recognition by cellular automata
• Deterministic one-way simulation of two-way real-time cellular automata and its related problems
• Parallel language recognition in constant time by cellular automata
• A hierarchy of uniquely parsable grammar classes and deterministic acceptors
• Real-time language recognition by one-dimensional cellular automata
• GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS

This page was built for publication: Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.