Directory of Context Sensitive Languages Resources
Home > Computers > Computer Science > Theoretical > Formal Language Theory > Context Sensitive Languages
A context-sensitive grammar is a formal grammar such that all its rules are of the form αAβ → αγβ with nonterminal A and α and β strings of nonterminals and terminals. The name context-sensitive is explained by the α and β that form the context of A and determine whether A can be replaced with γ or not. Context sensitive languages can be accepted by linear bounded automata.
Resources in This Category
-
Context Sensitive Languages and Linear Bounded Automata
http://www.cs.uiowa.edu/~fleck/PartIIIxpar/index.htm
A set of slides defining these terms and showing that context sensitive languages are accepted by linear bounded automata. -
Context-sensitive Examples
http://www.cs.uiowa.edu/~fleck/taylor.pdf
Grammars for three context sensitive languages that are not context free. -
Context-sensitive Language
http://en.wikipedia.org/wiki/Context-sensitive_language
A Wikipedia article which defines context sensitive languages in terms of context sensitive grammars which are defined in a linked article. -
Processing Natural and Formal Languages
http://www.inf.ed.ac.uk/teaching/courses/inf2a/
Lecture notes from a course at the University of Edinburgh, covering processing natural and artificial languages.
Related Categories
Home > Computers > Computer Science > Theoretical > Formal Language Theory > Context Sensitive Languages
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us
