Pure 2D picture grammars and languages

  • Authors:
  • K. G. Subramanian;Rosihan M. Ali;M. Geethalakshmi;Atulya K. Nagar

  • Affiliations:
  • School of Mathematical Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia;School of Mathematical Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia;Department of Mathematics, Dr. MGR Janaki College, Chennai 600028, India;Intelligent and Distributed Systems Laboratory, Department of Computer Science, Liverpool Hope University, Hope Park Liverpool, L16 9JD, UK

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

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.