(Word Problem) A finite state machine has one input (X) and two outputs (Z1 and Z2). An output Z1 = 1 occurs every time the input sequence 101 is observed, provided the sequence 011 has never been seen. An output Z2 = 1 occurs every time the input Oil is observed. Note that once Z2 = 1, Z1 = 1 can never occur. Assuming the machine is to be implemented in the Mealy design style, draw the corresponding state diagram. (Hint: The minimum number of states is eight.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.