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.

Thursday

March 23, 2017
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.

Search