Consider the problem of determining whether a PDA accepts
Chapter , Problem 5.33(choose chapter or problem)
Consider the problem of determining whether a PDA accepts some string of the form {ww| w {0,1}} . Use the computation history method to show that this problem is undecidable.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer