OK, i.e. must build the state table and filled it from this state diagram ??You can't determine what the sequence is that it is detecting because there is no accepting state identified, unless we interpret the output of 1 on the transition from F to C as indicating acceptance. Which is probably reasonable. But if so, then 00101 is not the only string it will accept, merely the shortest.
The language recognized by this Finite Automaton is actually pretty convoluted (not to mention infinite).
But I agree with tshuck and think that you are simply being asked to design an FSM that implements this transition diagram. To implement this, you will need to use a Meely Machine since the output depends on both the current state and the current input.
by Aaron Carman
by Aaron Carman
by Jake Hertz