1

title: Wrong answer.
Correct answers: $ab, aba, abb, aab$

2

  1. Does not belong in the regular language.
  2. Belongs in the regular language.
  3. 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 .

  1. title: Correct answers.
  2. 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

  1. 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]
    }
  2. 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]
    }
  3. Convert to an NFA.

    digraph {
    	sus
    }
title: Need to work on these.

8

  1. title: Wrong answer.
    Correct answer: $\epsilon \cup aa^* bb^* a^*$
  2. title: Wrong answer.
    Correct answer: $(a \cup b)^*aa(ba)^*$
  3. title: Wrong answer.
    Correct answer: $b(a \cup b)^* \cup (a \cup b)^*(aa \cup bb)(a \cup b)^*$
  4. title: Correct answer.