languages and fsm help
I seem to be stuck in the last section of my maths work,just cannot seem to grasp the logic behind it.....somebody please help??
here the last 2 questions.
a) Design and draw the state transition network for a deterministic nite state
machine acceptor for input alphabet {0; 1} which would accept strings which
start with 01 or 1, followed by any number of 0's, and and ending in the sequence
101 and no other strings.
b) Write out the State Transition Table that describes your machine.
thanks in advance
