Question

Subject test
Note:
You are attempting question out of 12
Consider the following statements.
I) The ARDEN’s lemma can be used for Deterministic finite automata (DFA), non-determinis
finite automata (NFA) and ε - NFA .
II) The number of DFAs to accept any regular language L is infinite.
III) By default, the Turing machine is deterministic in nature.​

Answer 1

Answer:

(nafs)

Explanation:

ii there is no ex