Question

Subject test
You are sempeing question Set of 12
Consider the following statements.
1) The ARDEN's lemma can be used for Deterministic finite automata (DFA), non-deterministic
finite automata (NFA) and g - NFA.
II) 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 III
(D) All are correct​

Answer 1

Answer:

c it will be I think dear