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. Permit Σ = {a, b, c} and permit L be the talk balance Σ attached underneath.

Permit sigma = {a, b, c) and permit L be the talk balance sigma attached 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) Substantiate your acceptance to the antecedent sever is rectify. (iii) Find a formal look E such that L(E) = L (you deficiency not attributable attributable attributable attributable attributable attributable substantiate your acceptance is rectify). (i) Find an NFA N such that L(N) = {epsilon}. (ii) Substantiate your acceptance to the antecedent sever is rectify. (iii) Find a formal look E such that L(E) = {epsilon}. (i) Find an NFA N such that L(N) = void. (ii) Substantiate your acceptance to the antecedent sever is rectify. (ii) Find a formal look E such that L(E) = void.