# dfa

Page 1 of 1

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

### #1 sunnysunny

Reputation: 0
• 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

• Games, Graphs, and Auctions

Reputation: 12306
• Posts: 45,403
• Joined: 27-December 08

## Re: dfa

Posted 23 October 2011 - 01:27 PM

Moved to Computer Science.

• Saucy!

Reputation: 6246
• Posts: 24,014
• 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?

### #4 sunnysunny

Reputation: 0
• 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