Consider the language $L$ given by the regular expression \((a+b)^{*} b…

GATE · 2017 · CS · Set 1 · Computer Science & IT

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 automaton (DFA) accepting $L$ is ___________ .

Attempted by 199 students.

Explore the full course: Gate Guidance By Sanchit Sir

Consider the language \(L\) given by the regular expression \((a+b)^{*} b…