search
Log In
0 votes
13 views
Let $INFINITE_{DFA} = \{\langle{ A \rangle}  \mid  \text{ A is a DFA and L(A) is an infinite language}\}$. Show that $INFINITE_{DFA}$ is decidable.
in Theory of Computation
edited by
13 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
0 votes
0 answers
3
...