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 noe both aba- and bab-substrings.
For example, the word abab does not belong to L.
Related Book For
Organic Chemistry structure and function
ISBN: 978-1429204941
6th edition
Authors: K. Peter C. Vollhardt, Neil E. Schore
Posted Date: