Which among the following are semi decidable?
(a) Empty-DFA
(b) Rec-NFA
(c) Infinite-DFA
(d) All of the mentioned
I got this question in an internship interview.
I would like to ask this question from The Universal Language-Undecidability topic in chapter Undecidability of Automata Theory