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 2n |
| B. | 2mn |
| C. | 2m+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, Click on Discuss to view users comments. vikki gound said: (1:06am on Thursday 23rd May 2013)
total length m nso required memory=2^m n
|
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 : Click on Discuss to view users comments. |
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 : Click on Discuss to view users comments. |
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 : Click on Discuss to view users comments. Aman said: (10:52am on Wednesday 26th July 2017)
Because there is an algorithm to convert DFSM to NDFSM and there may or may not be possible DPDM for every NDPDM so both are different
|
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) Click on Discuss to view users comments. Naween said: (8:32pm on Thursday 16th May 2013)
I think this ans is wrong as all are true as we expand each and every one all seems are true
Mrugesh said: (5:02pm on Wednesday 28th August 2013)
As property(PQ)*P = P(QP)* option A and B are also correct... So answer should be D !!!
taraka said: (12:16pm on Thursday 12th September 2013)
from the identity rules (PQ)*P=P(QP)* So option A and B also correct so final Option is 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
