Search code examples
automatadfa

Trying to Build DFA

I'm trying to build Deterministic finite Automata this formal language 

L = {w|w=Σ*0100} ⋂ {w=!Σ*11Σ*}

Any help building the automata

Solution

  • Here your language accepts all the strings which end in 0100 but do not contain 11. So, following automata satisfies your langauge.

    enter image description here

    Explanation:

    • state e is the null state. If automata encounter two 1 consecutively, it goes to null state and then no matter what comes, it is stuck in non-terminating state.
    • It search for 0100 and if it encounters it, it goes to terminating state d.