Problem $3$

Topic: Finite state machine design

Given the following description of a language, draw a finite state machine that accepts all

and only words in the described language. Assume the alphabet is $\{0,1\}.$ The machine

should:

Be deterministic

Have the start state annotated

Have the accepting state$($s$)$ annotated

wo words accepted by this machine have an optional $1$ symbol at the start of the word.

ollowing the optional $1,$ or at the start of the word if the optional $1$ is not present, is

exactly one $0$ symbol. After the $0$ is any count, including none, of the following: one or

more $1$ symbols followed by exactly one $0$ symbol. A non$-$exhaustive list of words in the

language is: $0,10,010,$baba,$0110,10110,01110,101110,01010,101010,011010,1011010,$