Question: 9) Consider two language L1 and L2 defined as follows: L1 = {x (a, b) | Where x contains the substring ab} L2 =

9) Consider two language L1 and L2 defined as follows: L1 =

 

9) Consider two language L1 and L2 defined as follows: L1 = {x (a, b) | Where x contains the substring ab} L2 = {x (a, b) | Where x contains the substring bba } A- Show the state diagram for L1 and L2. B- Show the optimal FA accepting L1 U L2.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!