Question 2981 – 2013 December UGC NET Paper 1
February 13, 2024Question 2982 – 2013 December UGC NET Paper 1
February 13, 2024Theory-of-Computation
|
Question 14
|
A finite state machine with the following state table has a single input x and a single out z.
If the initial state is unknown, then the shortest input sequence to reach the final state C is:
|
01
|
|
|
10
|
|
|
101
|
|
|
110
|
Question 14 Explanation:
If A is the start state, shortest sequence is 10 ‘or’ 00 to reach C.
If B is the start state, shortest sequence is 0 to reach C.
If C is the start state, shortest sequence is 10 or 00 to reach C.
If D is the start state, shortest sequence is 0 to reach C.
∴ (B) is correct.
Correct Answer: B
Question 14 Explanation:
If A is the start state, shortest sequence is 10 ‘or’ 00 to reach C.
If B is the start state, shortest sequence is 0 to reach C.
If C is the start state, shortest sequence is 10 or 00 to reach C.
If D is the start state, shortest sequence is 0 to reach C.
∴ (B) is correct.