Abstract
The shape regulated 2-dimensional matrix grammars of type 3 (SR2DM3 grammars), and a subclass of them, the depth increasing SR2DM3 grammars, are introduced. For each grammar in the latter class, we associate a 1-dimensional language, called its column language. It is shown that an e -free language is regular iff it is a column language of a depth increasing SR2DM3 grammar which is length consistent. The existence of a hierarchy between the regular and context-sensitive languages which are column languages of non-length consistent depth increasing SR2DM3 grammars is derived by formulating a machine characterization of these languages. Results concerning the structure of SR2DM3 grammars are also exhibited.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
