CS402 Assignment No 02 Solution

Question No 1:                                                                                                              Marks:5+5+5=15

Consider the following two regular languages:

Let L1 be the language defined over alphabet ∑={a    b} that contains all strings starting with alphabet a. (Example strings abbababa, aaaab, abaabbbb)

Let L2 be the language defined over alphabet ∑={a    b} that contains all strings in which alphabet a comes in the string in even number. (Example strings aba, bbabaaab, abaabba)

Construct the corresponding FAs of above languages. Construct the transition table for the intersection of above regular languages and a corresponding transition diagram for (FA1∩FA2).

CS402 Assignment Solution: