Abstract
We shall establish the existence of a hierarchy of language families in which the learning problem for each family is reduced to the learning problem for regular languages. The hierarchy is defined inductively by controlling certain type of even linear grammars with languages in one family to yield languages in the next larger family. Each family contains the family of regular languages and has a nontrivial language such as {an1an2 ··· an2i| n ≥ 0}, where i is a nonnegative integer and each aj is a symbol. Thus this boosts the learnability of learning algorithms for regular languages.
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.
