Consider the following deterministic finite automaton (DFA) defined over the…
PYQ GATE 2025
Consider the following deterministic finite automaton (DFA) defined over the alphabet, . Identify which of the following language(s) is/are accepted by the given DFA.

- A.
The set of all strings containing an even number of
’s. - B.
The set of all strings containing the pattern
. - C.
The set of all strings ending with the pattern
. - D.
The set of all strings not containing the pattern
.
Attempted by 162 students.
Sign up free to check your answer
Sign up freeLoading lesson…

