Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following statements are TRUE about Finite Automata (FA)?
(A) A finite automaton can recognize regular languages.
(B) Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA) are equivalent in terms of the languages they can recognize.
(C) An FA can have an infinite number of states.
(D) The transition function of a DFA is defined for every state and input symbol.
Choose the correct answer from the options given below:
1
(A), (B), (C) Only
2
(A), (B), (D) Only
3
(B), (C), (D) Only
4
(A), (C) Only