NPTEL IIT Guwahati

Conversely, let

accepts

i.e.

), then

for

inherits all other moves except the last one from M. Hence

for some

Thus M accepts . Informally, on any input simulate all the moves of M and enters in its own final state whenever M enters in any one of its final status in F. Thus accepts a string iff M accepts it.


	Pushdown Automata (PDA)	Print this page
	First \| Last \| Prev \| Next
	Conversely, let accepts i.e. L(), then for inherits all other moves except the last one from M. Hence for some . Thus M accepts . Informally, on any input simulate all the moves of M and enters in its own final state whenever M enters in any one of its final status in F. Thus accepts a string iff M accepts it.
	First \| Last \| Prev \| Next