Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Mr. Dubey • 52.48K Points
Coach

Q. Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

(A) 10

(B) 01

(D) 110

Correct Answer - Option(A)
Views: 333
Filed under category Theory of Computation

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Q. What are the types of requirement in Quality Function Deployment(QFD) ?

Q. Virtualization assigns a logical name for a physical resource and then provides a pointer to that physical resource when a request is made.

Q. The excess-3 code for 597 is given by

Q. The commands, from client to server, and replies, from server to client, are sent across the control connection in ____ bit ASCII format

Q. The procedure to add bits to the last block is termed as _________________

Q. Simplify the given expression to its Sum of Products (SOP) form Y = (A + B)(A + (AB)')C + A'(B+C')+ A'B+ ABC

Q. The assembler stores all the names and their corresponding values in

Q. Which of the following is not true about Incremental testing?

Q. Decision making is (simplistically) typically described as which of the following?

Q. Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Discusssion

Related MCQs

Question analytics