Question

Consider the following statements
1) The ARDEN'S lemua can be used for Deterministic linite automati F
finite automata (NFA) and E NEA.
11) 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:

A" (and any subsequent words) was ignored because we limit queries to 32 words.

Explanation:

please mark as brainliest

Answer 2

$\huge{\underline{\underline{\boxed{\sf{\purple{Answer࿐}}}}}}$

A) I and II