1
title: Wrong answer.
Correct answers: $ab, aba, abb, aab$2
- Does not belong in the regular language.
- Belongs in the regular language.
- Belongs in the regular language.
title: Correct answers.3
-
title: Correct answer. -
title: Correct answer.
4
-
title: Wrong answer. Can be $\epsilon, a, b$ -
title: Correct answer. -
title: Wrong answer. Can be $ba, aba, bab$
5
Let .
-
title: Correct answers. - No answer.
title: Wrong answer. Actual answer is $\beta^*(\alpha\beta^*\alpha\beta^*)^*$
6
Let . Show that the language is regular.
The language is regular because there is a regular expression representing it, e.g.
title: Checked solutions on how to answer this Q.7
-
Convert to an NFA.
digraph { rankdir=LR init[shape=point] node[shape=doublecircle]; r; node[shape=circle]; init->s s->s [label=a] s->s [label=b] s->q [label=a] q->r [label=b] } -
Convert to an NFA.
digraph { rankdir=LR init[shape=point] node[shape=doublecircle]; s; node[shape=circle]; init->s s->q [label=0] s->r [label=1] r->t [label=1] } -
Convert to an NFA.
digraph { sus }
title: Need to work on these.8
-
title: Wrong answer. Correct answer: $\epsilon \cup aa^* bb^* a^*$ -
title: Wrong answer. Correct answer: $(a \cup b)^*aa(ba)^*$ -
title: Wrong answer. Correct answer: $b(a \cup b)^* \cup (a \cup b)^*(aa \cup bb)(a \cup b)^*$ -
title: Correct answer.