Number of states of the FSM required to simulate behaviour of a computer with a memory capable of storing "m" words, each of length 'n'
A. | m x 2^{n} |
B. | 2^{mn} |
C. | 2^{m+n} |
D. | all of these |
Option: B Explanation :
For every data here length is ‘n’ and memory's states are defined in terms of power of 2, |
An FSM with
A. | 1 stack is more powerful than an FSM with no stack |
B. | 2 stacks is more powerful than a FSM with 1 stack |
C. | both (a) and (b) |
D. | None of these |
Option: C Explanation : |
If two finite states machine M and N are isomorphic, then
A. | M can be transformed to N, merely re-labelling its states |
B. | M can be transformed to N, merely re-labelling its edges |
C. | Both (a) and (b) |
D. | None of these |
Option: A Explanation : |
Power of
A. | DFSM and NDFSM are same |
B. | DFSM and NDFSM are different |
C. | DPDM and NDPDM are diferent |
D. | Both (A) and (C) |
Option: D Explanation : |
Which of the folowing pairs of regular expressions are equivalent ?
A. | 1 (01)* and (10)* 1 |
B. | x (xx) * and (xx) * x |
C. | x^{+} and x^{+}x*^{+} |
D. | All of these |
Option: D Explanation : Option (a) and option (b) are similar deriving expressions using rule :- (pq)*p = p(qp)* Option (c) will also be valid since:- (x+x*+) will be --->(xx*)(x*x**) --->(xx*)(x*x*) (Using x** = x*) --->(xx*)(x*) (Using x*x* = x*) --->(xx*) (Using x*x* = x*) --->x+ So, the answer will be all of these (Option d) |
Syllabus covered in this section is-
This Section covers Theory of Computation Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms Used For This Section Are