Is this finite state machine correct?

44 Views Asked by At

I have to build a f.s.m. for the language $((00)(0+1)^*)+((0+1)^*(110))$ is this correct?

Here's what I did

1

There are 1 best solutions below

3
On

This automaton (from the second version of your question):

Here's what I did

is correct.

As for this automaton (from the first version of your question):

Here's what I did

it is not correct, because it accepts $\mathtt{1010}$, which is not in your language. If you are using a nondeterministic automaton anyway, why don't you just split it into either the first expression of the union (which you got right) and the second (which you almost got right, but made a mistake in connecting the two).

I hope this helps $\ddot\smile$

Edit: Updated the answer to match the changed question.