|
A site which shows that the languages generated by phrase structure grammars are recursively enumerable languages. Similarly, it shows that the languages generated by context sensitive grammars are accepted by linear bounded automata. http://www.cis.upenn.edu/~cis511/Spring04/cis51104sl13pdf.pdf#search=%22context%20sensitive%20languages%22 |
|