recategorized by
189 views

1 Answer

0 votes
0 votes
In eyery string a must followed bb substring so the language accepted by the machine is l={abb,abbb,abbbbb,abbabb...}

now minimum length of the string is = 3

required no fo statesw = 3+1 = 4

               a               b

q0         q1               dead

q1         dead             q2

q2          dead            q3

q3          q1                 q3

Related questions

56
views
0 answers
0 votes
Ramkrishna Sahu asked 6 days ago
56 views
construct a minimal DFA for the regular language L= {W | w contain 'a' in every odd position, w∈{a,b}* }
154
views
1 answers
0 votes
Unnati Singh asked May 7
154 views
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
239
views
2 answers
0 votes
Unnati Singh asked May 7
239 views
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible by two.
214
views
0 answers
0 votes
rania asked Feb 14
214 views
Each of the following languages is the complement of a simpler language.In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the ... not in $a^{*}\cup b^{*}$ } ( ∪ is the union )