Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
type: Item
instance of: scholarly article
title: Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
zbMATH Open document ID: 1053.68063
DOI: 10.1016/S0304-3975(03)00083-5
author: Jia Lee
author: Katsunobu Imai
author: Kenichi Morita
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1965395
zbMATH Keywords: Uniquely parsable grammar
zbMATH Keywords: Cellular automata
zbMATH Keywords: Parallel parsing
MaRDI profile type: Publication
cites work: Q3339293
cites work: On real-time cellular automata and trellis automata
cites work: Q5592246
cites work: Fast parallel language recognition by cellular automata
cites work: GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
cites work: A hierarchy of uniquely parsable grammar classes and deterministic acceptors
cites work: Q4714446
cites work: Q4040284
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: Parallel language recognition in constant time by cellular automata
cites work: On real time one-way cellular array
cites work: Deterministic one-way simulation of two-way real-time cellular automata and its related problems
description: scientific article; zbMATH DE number 1965395