Paul Nicholls Stuff

25May/091

Context Sensitive Languages

A language is context-sensitive if it is recognised by a Linear Bounded Automaton (LBA). An LBA is a non-deterministic single-tape Turing Machine that can only use part of the tape (the tape is bounded).

There are basically no practical applications for Context-Sensitive Languages.

Tagged as: , Leave a comment
Comments (1) Trackbacks (0)
  1. Thank Paul.


Leave a comment

(required)

No trackbacks yet.