The minimum possible number of states of a deterministic finite automaton that…

PYQ GATE 2017

The minimum possible number of states of a deterministic finite automaton that accepts the regular language L=w1aw2∣w1,w2∈{a,b}∗∣w1∣=2,∣w2∣≥3L = w_{1}aw_{2} | w_{1},w_{2} \in \left \{ a,b \right \}^{*} \left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3 is ______________ .

Attempted by 357 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…