Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
From MaRDI portal
Publication:1401396
DOI10.1016/S0304-3975(03)00083-5zbMATH Open1053.68063MaRDI QIDQ1401396FDOQ1401396
Authors: Jia Lee, Katsunobu Imai, Kenichi Morita 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel language recognition in constant time by cellular automata
- Fast parallel language recognition by cellular automata
- On real time one-way cellular array
- A hierarchy of uniquely parsable grammar classes and deterministic acceptors
- Real-time language recognition by one-dimensional cellular automata
- On real-time cellular automata and trellis automata
- Title not available (Why is that?)
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
Cited In (4)
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)
