Question: Write a regular expression for each of the following (with concatention, kleene stars, unions, parenthesis, and/or unary plus): d) All words on = {, },
Write a regular expression for each of the following (with concatention, kleene stars, unions, parenthesis, and/or unary plus):
d) All words on = {, }, that their number of as mod 3 is 2. () 3 = 2
Example: abbabaaa, abbba
e) All words on = {, }, that do not have the substring aba.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
