Computer Sciences > GATE 2025 SET-1 > Finite Automata
Consider the following deterministic finite automaton (DFA) defined over the alphabet, Σ={a,b}. 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 b's.
B
The set of all strings containing the pattern bab.
C
The set of all strings ending with the pattern bab.
D
The set of all strings not containing the pattern aba.

Correct : d

Similar Questions

Which one of the following regular expressions correctly represents the language of the finite automaton given below?
#783 MCQ
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
#1371 MCQ
Let Σ={1,2,3,4}. For x∈Σ*, let prod(x) be the product of symbols in x modulo 7. We take prod(ε)=1, where ε is the null string.F...
#1467 NAT

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: