NPTEL IIT Guwahati

We have already shown

We now show the equivalence of

unrestricted grammars and TMs, and
context-sensitive grammars and LBAs.[ Note that we need to introduce the notion of LBAs first to do this]


	Chomsky Hierarchy	Print this page
	First \| Last \| Prev \| Next
	We have already shown the equivalence of FAs (regular language) and type-3 or regular grammars, and the equivalence of PDAs and CFGS. We now show the equivalence of unrestricted grammars and TMs, and context-sensitive grammars and LBAs.[ Note that we need to introduce the notion of LBAs first to do this]

	First \| Last \| Prev \| Next