Question: 1. Write a regular expression for the set of strings w over the alphabet {a,b} that do not have aba as a substring. (A string
1. Write a regular expression for the set of strings w over the alphabet {a,b} that do not have aba as a substring. (A string w does not have aba as a string if (i) it does not have ab as a substring, or (ii) every occurrence of ab is followed by b except possibly the last one occurring as a suffix.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
