Question: You are given two regular expressions defining two languages L1 and L2, as shown below. We want to find the Finite Automaton that defines the
You are given two regular expressions defining two languages L1 and L2, as shown below. We want to find the Finite Automaton that defines the intersection of the two language: L1 n L2. Answer the following questions
L1: (a + b)'a L2: (a + b)*aa(a + b)*
1. Derive and Draw the FA for the intersection of L1 and L2. 2. Describe in English or use a regular expression, what is the language for the intersection of L1 and L2.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
