The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 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


asked in Theory of Computation by Veteran (342k points)
edited by | 781 views
(d) ?

2 Answers

+6 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.

answered by Loyal (8.7k points)
If anything is right this should be the most probable. Otherwise None. :)
If the input is: 1011.

What will be output?

Since the diagram is ambiguous then it should be reported.
i can take objection in this question ma'am.bcoz of fig misprint .i marked option A
0 votes
  1. D ans
answered by (283 points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

35,518 questions
42,792 answers
42,162 users