Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
