Abstract
Context-sensitive languages are usually omitted in undergraduate textbooks on Theory of Computation or studied only from structural point of view in graduate textbooks with very few classical examples and no techniques of design of context-sensitive grammars and their corresponding linear bounded automata. Here we present a case of study showing that such omission and lack of examples and techniques can be fulfilled using standard techniques of formal languages. In particular it is stablished the descriptional and time complexity of an ambiguous context-sensitive grammar and a deterministic linear bounded automaton for the context-sensitive language L = { a^mb^nc^mn : m, n >= 1}
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.