3 Replies - 1168 Views - Last Post: 23 October 2011 - 03:05 PM

#1 sunnysunny  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 15
  • Joined: 19-October 11

dfa

Posted 23 October 2011 - 01:11 PM

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
Is This A Good Question/Topic? 0
  • +

Replies To: dfa

#2 macosxnerd101  Icon User is online

  • Self-Trained Economist
  • member icon




Reputation: 10565
  • View blog
  • Posts: 39,103
  • Joined: 27-December 08

Re: dfa

Posted 23 October 2011 - 01:27 PM

Moved to Computer Science.
Was This Post Helpful? 0
  • +
  • -

#3 JackOfAllTrades  Icon User is offline

  • Saucy!
  • member icon

Reputation: 6063
  • View blog
  • Posts: 23,516
  • Joined: 23-August 08

Re: dfa

Posted 23 October 2011 - 02:33 PM

So, how many times are you going to ask the same EXACT question without showing any effort on your own?
Was This Post Helpful? 0
  • +
  • -

#4 sunnysunny  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 15
  • Joined: 19-October 11

Re: dfa

Posted 23 October 2011 - 03:05 PM

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
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1