Abstract
The existence of a context-sensitive grammar, G u , which acts as a “generator” of all context-sensitive languages is established. Specifically, G u has the property that for each context-sensitive language, L, there exists a regular set, R L , and an e-limited gsm, g L , such that L= g L(L(G u)∩R L) . It follows that the family of context-sensitive languages is a principal AFL. An analogous result is proved for deterministic contextsensitive 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.
