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

Authors:
Jia Lee;Katsunobu Imai;Kenichi Morita
Affiliations:
Communications Research Laboratory, Nanotechnology Group, 588-2 Iwaoka, Iwaoka-cho, Kobe 651-2492, Japan;Department of Information Engineering, Hiroshima University, Higashi-Hiroshima 739-8527, Japan;Department of Information Engineering, Hiroshima University, Higashi-Hiroshima 739-8527, Japan
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 0

On real-time cellular automata and trellis automata

Acta Informatica
Parallel language recognition in constant time by cellular automata.

Acta Informatica
Fast parallel language recognition by cellular automata

Theoretical Computer Science
Parsing theory. Vol. 1: languages and parsing

Parsing theory. Vol. 1: languages and parsing
On real time one-way cellular array

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Quantified Score

Hi-index	5.33

Visualization

Abstract

A uniquely parsable grammar (UPG) introduced by Morita et al. (Acta Inform. 34 (1997) 389) is a special kind of generative grammar where parsing can be performed without backtracking. By extending a UPG, a uniquely parallel parsable grammar (UPPG) was proposed and its unique parallel parsability has been investigated. In this paper, we show any one-dimensional cellular automaton, as a parallel language recognition device, can be simply simulated by a parallel reduction in an equivalent UPPG.