Gate2017 cs Q17

0. Consider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state automation (DFA) accepting L is ______.

Note – Numerical Type question

Answer
Comment
Array

Option : A
Explanation :
The regular expression can be described as “All strings over {a, b} ending with “ba” or “bb”. The minimal DFA accepting L is having 4 states:

Forgot your password?

I agree with the Terms.