Question: Let INFINITE DFA = {A| A is a DFA and L(A) is an infinite language}. Show that INFINITE DFA is decidable.
Let INFINITEDFA = {〈A〉| A is a DFA and L(A) is an infinite language}. Show that INFINITEDFA is decidable.
Step by Step Solution
3.31 Rating (154 Votes )
There are 3 Steps involved in it
But we know that ATM is not decidable This is a contradiction hence ATM cannot be recognizable The l... View full answer
Get step-by-step solutions from verified subject matter experts
