Question

Construct a finite state machine which will accept precisely those binary strings which are of
the form
0
{11...1}>m
for some m=>0. Draw the state diagram to illustrate your answer, clearly marking the
starting state and any accepting states.

Answer 1

O.O Intro to ECE eh? i'll see if i have a paint program on this mac.

Answer 2

ECE?

Answer 3

digital logic

Answer 4

sorry? do you know how to do the question?