1. Let Σ = {a, b, c} and let L be the language over Σ given below.

Let sigma = {a, b, c) and let L be the language over sigma given below. L = {w elementof sigma*| if a appears in w then b appears in w}. Observe that epsilon, bcb, acb, bca elementof L. (i) Find a FSA A such that L(A) = L. (ii) Prove your answer to the previous part is correct. (iii) Find a regular expression E such that L(E) = L (you need not prove your answer is correct). (i) Find an NFA N such that L(N) = {epsilon}. (ii) Prove your answer to the previous part is correct. (iii) Find a regular expression E such that L(E) = {epsilon}. (i) Find an NFA N such that L(N) = empty. (ii) Prove your answer to the previous part is correct. (ii) Find a regular expression E such that L(E) = empty.1. Allow Σ = {a, b, c} and allow L be the tongue balance Σ ardent underneath.

Allow sigma = {a, b, c) and allow L be the tongue balance sigma ardent underneath. L = {w elementof sigma*| if a appears in w then b appears in w}. Observe that epsilon, bcb, acb, bca elementof L. (i) Find a FSA A such that L(A) = L. (ii) Verify your counter-argument to the antecedent bisect is redress. (iii) Find a symmetrical indication E such that L(E) = L (you want referable verify your counter-argument is redress). (i) Find an NFA N such that L(N) = {epsilon}. (ii) Verify your counter-argument to the antecedent bisect is redress. (iii) Find a symmetrical indication E such that L(E) = {epsilon}. (i) Find an NFA N such that L(N) = vacuity. (ii) Verify your counter-argument to the antecedent bisect is redress. (ii) Find a symmetrical indication E such that L(E) = vacuity.