Equivalence of Linear-bounded Automata and Context-sensitive Grammars by NPTEL
= Equivalence of Linear-bounded Automata and Context-sensitive Grammars by NPTEL
{c}
https://archive.nptel.ac.in/content/storage2/courses/106103070/modules/module-14/lecture-1/topic-1/s19.htm
Verified locator: IIT Guwahati Theory of Computation course, Chomsky Hierarchy module 14 lecture 1: two simulation theorems. Search-indexed technical text; direct HTML uses image-rendered mathematics.