5,241 views

4 Answers

10 votes
10 votes

ANSWER: OPTION C
In General If number of 0's is divisible by 'm' and number of 1's is divisible by 'n' ,
then no. of states = m*n 
so here Answer is = 2*5 =10

Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jul 1, 2016
4,761 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...
2 votes
2 votes
1 answer
2
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...
19 votes
19 votes
5 answers
3
Isha Karn asked Oct 29, 2014
10,451 views
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?$m \...
3 votes
3 votes
1 answer
4
go_editor asked Jul 1, 2016
3,656 views
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called asGrid ComputingNeutral NetworksPar...