Question

Question 1. Let Σ = {a, b}, and consider the language

L = {w ∈ Σ ∗ : w contains at least one b and an even number of a’s}.

Draw a graph representing a DFA (not NFA) that accepts this language.

Question 2. Let L be the language given below.

L = {a n b 2n : n ≥ 0} = {λ, abb, aabbbb, aaabbbbbb, . . .}

Find production rules for a grammar that generates L.

Answer 1

| W contains atleast one b and an even number of a's. b start b qo q 23 b b au a 95 If the input i abaaabaa, Start a b. 7 AAAAAA %6 93 93 qu 93 2 The 2 is final state, hence the hence the input is accepted

If the input input is bba start b b a 지 90 q al ar The 92 is state, hence the not final accepted. input is not

2. 1 a, aьь, ааьььь, aaaЬЬЬЬЬЬ . 3 Production Yules : ѕ аѕbь аЫь ја String : aaЬЬЬЬ S asbb 2aaЬЬЬЬ