Consider the following language: L_1 = ({0} {1}*{0}{1}({0} {1})*. This language

Question

Consider the following language: L_1 = ({0} {1}*{0}{1}({0} {1})*. This language is the language of all strings over {0, 1} that contain 01 as a substring. Notice that L_1 is expressed using the regular operations (union, concatenation, and Kleene star), and the languages {0}, {1}, {}, and. (a) Let L_2 be the language of all strings over {0, 1} that start with the substring 101 and end with an even number of consecutive 0's. Express L_2 using the regular operations and the languages {0}, {1}, {}, and 0. (b) Let L_3 be the language of all strings over {0, 1} that contain an even number of 0's. Express L_3 using the regular operations and the languages {0}, {1}, {}, and 0.

Explanation / Answer

a)starts with substring 101

and ends with even number of consecutive zero's

answer : L2 = {1}{0}{1}{{0} U {1}}*{{0}{0}}*

b)contain's even number of zeros

answer : L3 = {{1}* U {0}{1}*{0}}*

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.