DFA doubt

Question

DFA in which 01 and 10 have equal number of occurrences

Comments

cool... thank u :)

---

@aditi19 i think i have sorted out please look out this image https://ibb.co/4t9sXvq

the question is nice , i hope i got this right , let me know if iam wrong

 

---

https://gateoverflow.in/47443/isi2014-cs-4a

Answer 1

Please check.

Comments

Where it is wrong.

---

sry,

you are right @raahul

Answer 2

the problem can not be solved by just making a FA , and those who are making seems to misunderstood that a FA  (dfa and nfa ) are not capable of counting. the only version  of FA capable of counting number of occurence of string is TRANDUCERS ( mealy and moore ).

 

further the question can only be answered by making a transducer,  see below the moore machine : https://ibb.co/Wgmwvkm

edit : the above question can be given by DFA also , i thought of counting only ( my bad ) , please look here https://ibb.co/4t9sXvq

Comments

@raahul well if you dont care how many of  them occur then why yo could not have asked the same question as DFA whose string end with either 01 or 10 ?

---

That is another question .We can construct DFA for that also. Leave it now. You can go with your method.

---

@rballiwal

Let suppose you are right, then my dfa should be wrong, right ?

if you tell in which case it is wrong, then i agree on your statement !