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
The more I read this formulation, the more it seems somewhat ambiguous to me. It may mean, "followed by any number of 0's and then by 101" or "followed by any number of 0's. It also must end in 101." In the latter case, 101 is accepted because it starts with 1 followed by one 0; it also ends with 101, but in the former case, it is not accepted. The automaton I draw corresponds to the former case; the latter one is more complicated.a deterministic finite 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
I am also not sure what exactly you don't understand. If you need more intuition about how FSM work, write several strings consisting of 0's and 1's and see whether the automaton above accepts them by following from one state to the next along the arrows. The arrow's label (0 or 1) must correspond to the next unread character in the string. If you end up in the state with the double border when the string is exhausted, the string is accepted; otherwise it is not accepted.