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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
