Question

Automata Question.

Over the alphabet Σ = {0, 1}:

1) Give a DFA, M₁, that accepts a Language L₁ = {all strings that contain 00}

2) Give a DFA, M₂, that accepts a Language L₂ = {all strings that end with 01}

3) Give acceptor for L₁ intersection L₂

4) Give acceptor for L₁ - L₂

Answer 1

Given E = {0.13 A] DFA, m, that accepts a language L1= {all Strings that contain 00} ,0 Eg: L = {00, 100,001, 1100, 1000.} 23 DFA Ma that accepts a language A) Lg = {all strings that end with 013 Eg: 19 = {01, 101,001,1001 1101. 3 qo 3) Aj Accepton four L, intersection La + Ling - {0001, 10001 :) 110001 2 LnLg = Ad (69) Al L, ng Accepts language contain strings oo and BO B2) end with ol. (C22) → (AI) Bri To A9

47 Accepton for L.-Lg A) L-Ly = {All strings contains on but does not end with or } → (A B 0,1 Egi - L-Lg = {10010, 0010, 1010011..