Q$1$ A Simple DFA

$1\mathrm{.}5$ Points

Grading comment:

Let

M

$1$

M

$1$

$$

be a deterministic finite automaton $($DFA$)$ with the following description:

Q

$=$

$\{$

q

$1$

$,$

q

$2$

$,$

q

$3$

$,$

q

$4$

$\}$

Q$=\{$q

$1$

$$

$,$q

$2$

$$

$,$q

$3$

$$

$,$q

$4$

$$

$\}$

$\backslash$Sigma

$=$

$\{$

$0$

$,$

$1$

$\}$

$\backslash$Sigma $=\{0,1\}$

$\backslash$delta

$\backslash$delta given as:

$0$

$1$

q

$1$

q

$1$

q

$2$

q

$2$

q

$3$

q

$2$

q

$3$

q

$2$

q

$2$

q

$1$

$$

q

$2$

$$

q

$3$

$$

$$

$0$

q

$1$

$$

q

$3$

$$

q

$2$

$$

$$

$1$

q

$2$

$$

q

$2$

$$

q

$2$

$$

$$

$$

q$1$ is the start state

F$=\{$q $2\}$

Question $1\mathrm{.}1$ Draw the state diagram

Q$1\mathrm{.}1$ Draw the state diagram

$0\mathrm{.}5$ Points

Grading comment:

Draw the state transition diagram of

M

$1$

M

$1$

$$

$.$

Important: All finite state machine diagrams submitted in the assignments $($i$.$e$.,$ in Assignments $1-5)$ must be rendered as a vector$-$style graphic $($i$.$e$.,$ not drawn by hand$).$