I'm looking for a second opinion on this question. Please explain the answer so I understand how it is done. What is the regular expression and FA that defines L1 â‹‚ L2: L1 = (ab*)* L2 = (a + b)*aa(a + b)*
Added by Brandi R.
Close
Step 1
L2 = (a + b)*aa(a + b)* This means that L2 consists of zero or more occurrences of either "a" or "b", followed by "aa", followed by zero or more occurrences of either "a" or "b". Now, let's try to define L1 â‹‚ L2, which represents the intersection of L1 and L2. Show more…
Show all steps
Your feedback will help us improve your experience
Brooke Bussoletti and 82 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Find a regular expression for $L=\left\{u v u: u, v \in\{a, b\}^{*},|u|=2\right\}$ (A) $(a b)^{*} a(a b)^{*}$ (B) $(a a)^{*} a b(a a)^{*}$ (C) $a a(a+b)^{*} b b+b b(a+b)^{*} a a$ (D) $a a(a+b)^{*} a a+a b(a+b)^{*} a b+b a(a+b)^{*} b a+b b$ $(a+b)^{*} b b$
Databases
File Management
2.) Find all strings in L((ab + b)*b(a + ab)*) of length less than four 2b.) Give a regular expression for L = {anbm; n≥3, m≤4} 2c.) Find a regular expression that is accepted for the following automata: 2d.) Let L1 = L(ab*aa), L2 = L(a*bba*). Find a regular expression for (L1∪L2)*L2.
Madhur L.
Find regular expressions for the following languages on {a, b}. L={w: |w| mod 3 ≠ 0}. b) L={w: |w| mod 3 = 0} L={w: |w| mod 5 > 0}. L={w: |w| mod 3 = 0}.
Sri K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD