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 inal state C is
|
Present state |
Next state, z |
|
|
|
X = 1 |
X =0 |
|
A |
D, 0 |
B, 0 |
|
B |
B, 1 |
C, 1 |
|
C |
B, 0 |
D, 1 |
|
D |
B, 1 |
C, 0 |
| A. | 01 |
| B. | 10 |
| C. | 110 |
| D. | 110 |
|
Option: B Explanation : Click on Discuss to view users comments. POONAM RANI said: (2:14am on Saturday 11th February 2017)
Incompletely automata bcz initial state is unknown
|
An FSM can be used to add how many given integers ?
| A. | 1 |
| B. | 3 |
| C. | 4 |
| D. | 2 |
|
Option: D Explanation :
Finite Automata (FA) or Finite State Machine to add two integers can be constructed using two states: Click on Discuss to view users comments. yogi said: (8:38pm on Tuesday 29th January 2013)
how to say 3 integer
shivangi said: (4:13pm on Friday 14th February 2014)
How to say 3?
|
If two finite state machines are equivalent, they should have the same number of
| A. | states |
| B. | edges |
| C. | states and edges |
| D. | none of these |
|
Option: D Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Theory of Computation Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms Used For This Section Are
