Question

Subject test
Note: -
You are attempting question 12 out of 12
Consider the following statements.
I) The ARDEN's lemma can be used for Deterministic finite automata (DFA), non-deterministic
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.
(A) I and II
(B) I and III
(C) II and III
(D) All are correct​

Answer 1

Answer:

all are correct because it is correct

Answer 2

All the statements are correct.

• The ARDEN'S  lemma can be used for all three DFA, NFA, and E-NFA. The equivalence can be checked of the regular expressions.
• The number of DFAs to accept any regular language L is infinite. However, the minimum is required to be 3 states.
• The Turing machine can be used for determining the limitations and abilities of algorithms. The mathematical expressions of a computer are held in the Turing machines.
• Arden's theory is used to find and convert regular expressions of a finite automaton. When the regular expressions are equal we use this theory.
• The finite automata should not contain ε- transition and the FA should have only one initial static.

Thus, all three statements are correct and the right option is (D).

#SPJ2