edited by
10,220 views
4 4 votes

Diagram of finite Automata

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

2 Answers

10 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.

0 0 votes
  1. D ans
Answer:
Position:
Show:

Related questions

4 4 votes
3 answers 3 answers
10.5k
10.5k views
Arjun asked Apr 22, 2018
10,467 views
Choose the correct statement -$A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular languageThe set $B$, consisting of all strings made up of only $a's$ and $b's$ having eq...
4 4 votes
2 2 answers
2.4k
2.4k views
Arjun asked Apr 22, 2018
2,441 views
$CFG$ (Context Free Grammar) is not closed under: UnionComplementationKleene starProduct
3 3 votes
3 3 answers
4.3k
4.3k views
Arjun asked Apr 22, 2018
4,297 views
A $CFG$ (Context Free Grammar) is said to be in Chomsky Normal Form $(CNF)$, if all the productions are of the form A$\to$ BC or A$\to$ a. Let $G$ be a $CFG$ in $CNF$. To...
11 11 votes
3 answers 3 answers
12.8k
12.8k views
Arjun asked Apr 22, 2018
12,838 views
Consider the following program{ int x=1; printf("%d",(*char(char*)&x)); }Assuming required header files are included and if the machine in which this program is executed ...