Question: Prove that the equivalence problem (whether two arbitrary machines accept the same set) for pushdown automata is unsolvable. (HINT: relate it to a pushdown machine
Prove that the equivalence problem (whether two arbitrary machines accept the same set) for pushdown automata is unsolvable. (HINT: relate it to a pushdown machine problem you know is unsolvable.) Do the same for the set inclusion problem.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
