Question: For construct a regular expression defining each of the following languages over the alphabet = {a b} : All words in which a appears
For construct a regular expression defining each of the following languages over the alphabet Σ = {a b} :
All words in which a appears tripled, if at all. This means that every clump of a's contains 3 or 6 or 9 or 1 2 . . . a's.
Step by Step Solution
3.39 Rating (158 Votes )
There are 3 Steps involved in it
This language can be defined by the following regular expression aaa The first term in the regular e... View full answer
Get step-by-step solutions from verified subject matter experts
