If you attend class on
8/26,
you will have a chance to do this
assignment in-class for the
C_{1} grade
(cake)|(death)
cake|death
Create a regular expression that is as short as possible (in terms of characters used to write down the regular expression) but matches the same language as:
a|(aa)|(a*)
a((bc)?)
a
(0 repetitions of bc
)
and
abc
(1 repetition of bc
).
Using the operators listed previously, change the above regular expression so that it doesn't use the ? operator but specifies the same language of strings. Hint: you may use the empty string symbol ε in your answer