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

DOI10.1016/S0304-3975(03)00083-5MaRDI QIDQ1401396zbMATH OpenFDO

Authors Jia Lee, Katsunobu Imai, 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

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

Recommendations

• GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
• A hierarchy of uniquely parsable grammar classes and deterministic acceptors
• A three-dimensional uniquely parsable array grammar that generates and parses cubes
• scientific article; zbMATH DE number 1543333
• Uniquely parsable unification grammars and their parser implemented in Prolog

Cites work

• scientific article; zbMATH DE number 3872685 (Why is no real title available?)
• scientific article; zbMATH DE number 193480 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A hierarchy of uniquely parsable grammar classes and deterministic acceptors
• Deterministic one-way simulation of two-way real-time cellular automata and its related problems
• Fast parallel language recognition by cellular automata
• GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
• On real time one-way cellular array
• On real-time cellular automata and trellis automata
• Parallel language recognition in constant time by cellular automata
• Real-time language recognition by one-dimensional cellular automata

Cited in

(4)

• Progress, gaps and obstacles in the classification of cellular automata
• A three-dimensional uniquely parsable array grammar that generates and parses cubes
• A comprehensive taxonomy of 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.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401396)