Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421311 | Discrete Applied Mathematics | 2009 | 11 Pages |
Abstract
A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal picture arrays on triangular grids.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
K.G. Subramanian, Rosihan M. Ali, M. Geethalakshmi, Atulya K. Nagar,