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

PYQ GATE 2017

Consider the language LL given by the regular expression (a+b)∗b(a+b)(a+b)^{*} b (a+b) over the alphabet {a,b}\{a,b\}. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting LL  is ___________ .

Attempted by 238 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…