[sunnysunny]

state diagram of a DFA that recogniZe all the strings over{a,b} that are generated by regular expression a^*b^+
i have taken two strings q0(start state) and q1(acceptance state)

with a input q0->q0 and with b input q0->q1
with a input q1->q1 and with b input q1->q1

is it correct if not what is the state diagram of this thanks

[macosxnerd101]

Moved to Computer Science.

[JackOfAllTrades]

So, how many times are you going to ask the same EXACT question without showing any effort on your own?

[sunnysunny]

state diagram of a DFA that recogniZe all the strings over{a,b} that are generated by regular expression a^*b^+
i have taken two strings q0(start state) and q1(acceptance state)

with a input q0->q0 and with b input q0->q1
with a input q1->q1 and with b input q1->q1

is it correct if not what is the state diagram of this thanks
i am showing my effort i dont know may be this the way you want me to ask