Post a New Question

computer sciece

posted by on .

Let INFINITE PDA ={<M>|M is a PDA and L(M) is an infinite language} Show that INFINITE PDA is decidable.

  • computer sciece - ,

    yo

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question