Abstract
Infinite subfamilies ℒ 1 , ℒ 2 ..., ℒ ∞ , ℒ ω of the family consisting of contextsensitive languages, are introduced such that ℒ 1 C ≠ ℒ 2 C ≠ ⋯C ≠ ℒ ∞ ℒ ω , where ℒ 1 is the family of ∈-free context-free languages, ℒ ω is the family of context-sensitive languages, and each ℒ n is an Abstract Family of Languages, i.e., closed under +, ·, U, inverse-homomorphism, ∈-free homomorphism, and intersection with regular sets. Each language of ℒ n is defined by a grammar, called a state grammar, that may be thought of as a context-free gramma with states.
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.
