Question: Construct a regular expression that defines the language L (say) containing all the words with either exactly one aba-substring or exactly one bab-substring but not
Construct a regular expression that defines the language L (say) containing all the words with either exactly one aba-substring or exactly one bab-substring but not both aba- and bab-substrings.
(For example, the word abab does not belong to L.)
Step by Step Solution
3.44 Rating (154 Votes )
There are 3 Steps involved in it
To construct a regular expression that defines the language L containing all the words with either e... View full answer
Get step-by-step solutions from verified subject matter experts
