Question: For each of the following pairs of regular languages, find a regular expression and an FA that each define L 1 L 2 :
For each of the following pairs of regular languages, find a regular expression and an FA that each define L1 ∩ L2:
L1 L2
All strings of even length b(a + b)*
= (aa + ab + ba + bb)*
Step by Step Solution
3.41 Rating (164 Votes )
There are 3 Steps involved in it
Our regular expression for L1 is aa ab ba bb Our regular expression for L2 is ba b Therefor... View full answer
Get step-by-step solutions from verified subject matter experts
