![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Generalized Context-Free (Regular) Kolam Array Grammars [GCF(R)KAG] are introduced as models for generation of rectangular arrays. These grammars are found to be richer in generative capacity than Context-Free (Regular) Kolam Array Grammars. Two subclasses of these grammars are also considered. Comparisons are made. Hierarchies and closure properties are examined. The effects of control devices on GCF(R)KAGs are discussed.