Back to Results
First PageMeta Content
Mathematics / Applied mathematics / Computability theory / Complexity classes / Recursively enumerable language / Unrestricted grammar / Computability / Linear bounded automaton / Context-sensitive language / Formal languages / Theoretical computer science / Theory of computation


Section 14.2 A Hierarchy of Languages Context-Sensitive Languages A context-sensitive grammar has productions of the form xAz → xyz, where A is a nonterminal and x, y, z are strings of grammar symbols with y ≠ Λ. Th
Add to Reading List

Document Date: 2010-12-18 13:22:30


Open Document

File Size: 70,21 KB

Share Result on Facebook
UPDATE