Construct a regular expression that defines the language L (say) containing all the words with either exactly
Fantastic news! We've Found the answer you've been seeking!
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 both aba- and bab-substrings.
(For example, the word abab does not belong to L.)
Related Book For
Posted Date: