| | - Context sensitive
Computationally the contextsensitive languages are equivalent with linear bounded nondeterministic Turing machines, also called a linear bounded automaton. That is a nondeterministic Turing machine with a tape of only kn cells, where n is the size of ...
http://en.wikipedia.org/wiki/Context-sensitive_language
|
| |
- The Context sensitive
Grammars for three context sensitive languages that are not context free. ...
http://www.cs.uiowa.edu/~fleck/PartIIIxpar/index.htm
|
| |
|
- The Context Sensitive Languages
A set of slides defining these terms and showing that context sensitive languages are accepted by linear bounded automata. ...
http://www.cs.uiowa.edu/~fleck/PartIIIxpar/index.htm
| | |
| |
- Processing Natural and Formal
Lecture notes from a course at the University of Edinburgh, covering processing natural and artificial languages. ...
http://www.inf.ed.ac.uk/teaching/courses/inf2a/
|
| |
