Question: For construct a regular expression defining each of the following languages over the alphabet = {a b} : All words in which a is
For construct a regular expression defining each of the following languages over the alphabet Σ = {a b} :
All words in which a is tripled or b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both.
Step by Step Solution
3.48 Rating (181 Votes )
There are 3 Steps involved in it
The regular expression is sab where indicates repeating ... View full answer
Get step-by-step solutions from verified subject matter experts
