Finite Images Generated by GL-Systems

In this paper, we introduce a new device called GL-systems (i.e. Grammar-Lindenmayer systems) for generating finite images. GL-systems are sequential/parallel systems in which the horizontal rules form a Chomskian grammar and the vertical rules form a DTOL system. We obtain hierarchical results of various types of GL-systems. We study some properties like, closure properties, combinatorial results, pumping lemma and decidability results. An algebraic characterization for GL-systems (with variation) is presented.