-3

What's the transition diagram of this Finite Automata? Is the diagram shown in the image correct?

Jack B
  • 11
  • 1
  • 3

1 Answers1

0

it's a very basic automata !

It can be completed with a "Trash" state if needed ... Coresponding regex is : 0(0|1)*1

FSA

Gerard Rozsavolgyi
  • 4,834
  • 4
  • 32
  • 39