Question: Construct a regular expression defining each of the following languages over the alphabet = { a b } : a) All words in which a
Construct a regular expression defining each of the following languages over the alphabet
= { a b } :
a) 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 12 . . . a's.
b) All words that contain at least one of the strings
,
,
, or
.
c) All strings that end in a double letter.
d) All strings that do not end in a double letter.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
