10,464 views

5 Answers

Best answer
40 votes
40 votes

We need to find the number of different configurations possible for memory and each of these will be a state in FSM. (At any time memory will be in one configuration and in next instance it either remains same or goes to a different configuration)

A word is of n bits. And we have m such words. So, total number of bits = m*n.

We need a separate state for each bit combination. So, no. of states = 2mn.

selected by
2 votes
2 votes

For every data here length is ‘n’ and memory's states are defined in terms of power of 2, 
Here the total memory capability for all the words = mn
Hence number of states are 2mn

1 votes
1 votes

Total m words. Each of size n bit.

Total m*n bits .

Number of states in FSM  are 2m*n
 

[ 1 bit need 1 flip-flop , represent 2 states, 0 or 1.]

Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jul 1, 2016
4,762 views
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
7 votes
7 votes
5 answers
2
naga praveen asked Jun 13, 2016
5,383 views
The following Finite Automaton recognizes which of the given languages?$\{ 1, 0 \}^* \{ 0 1 \}$$\{ 1,0\}^*\{ 1\}$$\{ 1 \} \{1, 0\}^*\{ 1 \}$$1^*0^*\{0,1\}$
6 votes
6 votes
4 answers
3
kvkumar asked Jun 29, 2016
5,241 views
How many states are there in a minimum state deterministic finite automaton accepting the language $L = \{w \mid w \in \{0,1\}^*,$ number of 0's is divisible by 2 and num...
2 votes
2 votes
1 answer
4
ajit asked Sep 23, 2015
4,725 views
Which of the following is FALSE with respect to possible outcomes of executing a Turing Machine over a given input?it may halt and accept the inputit may halt by changing...