Consider the following statements. D The ARDEN's lemma can be used for Deterministic finite automata (DFA), non-deterministic finite automata (NFA) and e- NFA. ID The number of DFAs to accept any regular language L is infinite. III) By default, the Turing machine is deterministic in nature.
(A) I and II
(B) I and III
C)II and II
D) All are correct
Answers
Answered by
0
Answer:
i think D is this write or not let me know
Similar questions