Consider the language \(L\) given by the regular expression \((a+b)^{*} b…
PYQ GATE 2017
Consider the language given by the regular expression over the alphabet . The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting is ___________ .
Attempted by 238 students.
Sign up free to check your answer
Sign up freeLoading lesson…

