Question: 1) a. Let L 1 be defined by the regular expression (a+b)*a . (Show work in both tabular and graphic representation of each FA that
1)
a. Let L1 be defined by the regular expression (a+b)*a . (Show work in both tabular and graphic representation of each FA that you build)
b. Let L2 be defined by the regular expression b(a+b)* . (Show work in both tabular and graphic representation of each FA that you build)
c. Using the two FAs that you constructed in part a and b above, construct an FA to accept the language
L1
L2 . Use DeMorgan's identity: L1
L2 = ( L1'
L2' )' , to construct a new FA. (Show work in both tabular and graphic representation)
d. Apply the bypass and state-elimination algorithm to the resultant FA from Part c to reduce it to a regular expression. (Show work in both tabular and graphic representation)
e. Using the two FAs that you constructed above use the formula: ( L1'
L2' )'+( L2'
L1' )' , to show that the two languages above are not identical. (Show work in both tabular and graphic representation)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
