draw dfa

Question

DFA which accepts strings in which every 'a' is followed by a    'b'

Comments

https://gateoverflow.in/128551/minimization-of-dfa

---

my question is different   which every 'a' is followed by a    'b'  single b at end gauravkc

---

Didn't get it. Can you show some strings?

Answer 1

check this one

Comments

@Aarti3001  abb ,abbb should not be accepted every a should be followed by   a     "b "  // single b at end

---

construct a dfa in which every a is followed a "b"i.e single b...it means such strngs {abb,abbb,abbbb,....},,,should not cntain in the language.  @gauravkc

---

I thought every a followed by only one b

---

that must be the dfa that accepts

{ab,abab,ababab,... }

---

this is what i said yes

---

b^* also accepted??

---

@gauravkc yes  you are correct here @ that must be the dfa that accepts

{ab,abab,ababab,... } 

but a dfa should be such that it should accept all strings contained in  languages  , as well as dfa should be able to reject all strings which are not there in langugae  according to my question abb should not be present but abb is accepted by dfa so dfa is not suitable

---

according to question if a comes then only  single b should be there  after it  i.e. ab  

but if  a donot come in string then  no restriction on b   so b^* should be acceptable @Aarti3001

---

i think this will work

---

let me draw mine wait

---

Like this?

---

Oops.. forgot to show a,b loop on dead state.

It is same as  @Aarti3001 

---

every a followed by exactly 1 'b'

---

@Aarti3001   @LeenSharma yes correct dfa   @gauravkc  thanku