Finite Automata

Question

Construct dfa for set of all strings where every pair of consecutive 0's occurs before any pair of adjacent 1's ?

Comments

https://gateoverflow.in/53010/strings-which-every-pair-adjacent-appear-before-pair-adjacent

Answer 1

Language accepted by the DFA, L = ( 1 + 01 + 001⁺1)* + 0 + (1⁺0 + 011⁺0)*

Total no of state = 5

No of final state  = 2.

Comments

In other words, whenever 11 appears, it should be always after 00.

1101010100 - not accepted

001000101011 - accepted

0,1,11,00 can be accepted as they are not violating the condition.

---

@Kapilp, set of all strings where every pair of consecutive 0's occurs before any pair of adjacent 1's.

I think it says, If any 00 comes then it should be followed by any 11 (pair of 1's.).

Do you think, your 2nd example - L= 001000101011 should be excepted ..??

Bold pair of 00 is not before any pair of 1's  ... am I right  ??

---

001000101011, 

11 can appear anytime after 00, but not before .