Abstract
In this note a new model of grammatical picture generation is introduced. The model is based on the notion of pure context-free grammars of formal string language theory. The resulting model, called Pure 2D context-free grammar (CFG), generates rectangular picture arrays of symbols. The generative power of this model in comparison to certain other related models is examined. Also we associate a regular control language with a Pure 2D CFG and notice that the generative power increases. Certain closure properties are obtained. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Subramanian, K. G., Nagar, A. K., & Geethalakshmi, M. (2008). Pure 2D picture grammars (P2DPG) and P2DPG with regular control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4958 LNCS, pp. 330–341). Springer Verlag. https://doi.org/10.1007/978-3-540-78275-9_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
