Search code examples
automatadfanfa

Find the DFA for the language L given

L is a language over {x,y,z} where x's are never preceded by y's and never followed by z's

Solution

  • DFA for language L This DFA can also be drawn using AND for two part,i.e first part is x's are never preceded by y's second part is x's are never followed by z's