Tuesday
May 3, 2016

Homework Help: computer sciece

Posted by Tracy on Monday, January 9, 2012 at 10:49am.

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

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions