Question
Let $\mathrm{L}$ be a regular language over $\{a, b, c\}$. Show that each of the following sets is regular.a) $\{w \mid w \in \mathrm{L}$ and $w$ contains an $a\}$b) $\{w \mid w \in$ L or $w$ contains an $a\}$c) $\{w \mid w \notin \mathrm{L}$ and $w$ does not contain an $a\}$
Step 1
This set can be described by the regular expression $(b+c)^*a(b+c)^*$, which represents any string over $\{a, b, c\}$ containing at least one $a$. Since regular expressions describe regular languages, $A$ is a regular language. Show more…
Show all steps
Your feedback will help us improve your experience
100,000+
Students learning Computer Science with Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD