RLM Q6

0. A finite state machine with the following state table has a single input x and a single output z. If initial state is unknown, then shortest input sequence to reach the final state C is
Present stateNext state, z
 X = 1X =0
AD, 0B, 0
BB, 1C, 1
CB, 0D, 1
DB, 1C, 0

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *