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


A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) 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… (More)
DOI: 10.1016/S0304-3975(03)00083-5