in Theory of Computation edited by
7,036 views
4 votes
4 votes

The $FSM$ (Finite State Machine) machine pictured in the figure above

  1. Complements a given bit pattern
  2. Finds $2's$ complement of a given bit pattern
  3. Increments a given bit pattern by $1$ 
  4. Changes the sign bit
in Theory of Computation edited by
by
7.0k views

3 Comments

(d) ?
0
0
Despite the error in the FSM, ISRO didn't change the key or discard the question.
0
0
please change the tag from theory of computation to digital circuits
0
0

2 Answers

10 votes
10 votes

I think there is some error in the diagram. If DFA had been like this :

.

Ans:(c) Increments a given bit pattern by 1.

by

4 Comments

i can take objection in this question ma'am.bcoz of fig misprint .i marked option A
1
1
If input is 1010, the output is 0110. I don't understand how is this FSM increasing the bit pattern by 1.
1
1
Let's taken an example

input 1011

start from right (1101) and analyze with machine output tends to be 0011 now back to the original way it means 1100.

And if you add 1 with actual input 1011 +1 = 1100.
2
2
0 votes
0 votes
  1. D ans

1 comment

What is the order in which we should process our String. Like if String is 1010101 should i start input from left or from right??
1
1
Answer:

Related questions