GATE 2017 Previous Year Paper Solution Question 19 – Computer Science
In this video, the question which was asked in the exam of GATE 2017, has been discussed.
Question :- Consider the language L(a+b)*b(a+b) given by the regular expression over the alphabet {a,b}. The smallest number of states needed in a deterministic finite-state automation (DFA) accepting L is _____________ .
Solution is explained in the video.
