Questions LLC
Login
or
Sign Up
Ask a New Question
Pushdown Automaton (PDA)
Questions (1)
Let INFINITE PDA ={<M>|M is a PDA and L(M) is an infinite language} Show that INFINITE PDA is decidable.
3 answers
asked by
Tracy
1,041 views
Parent Categories (1)
Automata Theory
