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

9) Consider two language L1 and L2 defined as follows: L1-(x L2 x (a, b) | Where x contains the substring ab J (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
Get step-by-step solutions from verified subject matter experts
