each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not.  1. (a∗b)∗|a∗ 2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 7SA
icon
Related questions
Question

For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not. 

1. (a∗b)∗|a∗
2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning