# Theory of Computation and Compilers - Regular Language Models

>>>>>>>>Regular Language Models

• 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,
Here the total memory capability for all the words = mn
Hence number of states are 2mn

• 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  • 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  • A

DFSM and NDFSM are same  • B

DFSM and NDFSM are different  • C

DPDM and NDPDM are diferent  • D

Both (A) and (C)  • 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)
Related Quiz.
Regular Language Models