Abstract
In this paper we study the generative capacity of EOL forms from two different points of view. On the one hand, we consider the generative capacity of special EOL forms which one could call `linear like' and `context free like', establishing the existence of a rich variety of non-regular sub-EOL language families. On the other hand, we propose the notion of a `generator' L of a language family ? We mean by this that any synchronized EOL system generating L generates -- if understood as an EOL form -- all languages of ?. We characterize the generators of the family of regular languages, and prove that other well known language families do not have generators.
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.
