Learning For Everyonea) m x 2n
b) 2mn
c) 2(m+n)
d) all of the mentioned
For every Data here length is n and memory’s state is defined in terms of power of 2, Here the total memory capability for all the words = mn Hence the number of states is2<sup>mn</sup>.
a) M can be transformed to Numeral relabeling its states
b) M can be transformed to N, merely relabeling its edges
c) Both of the mentioned
d) None of the mentioned
The Definition of FSM states that M can be transformed to N by relabeling its states or its edges.
a) A Context free language can be accepted by a deterministic PDA
b) union of 2 CFLs is context free
c) The intersection of two CFLs is context free
d) The complement of CFLs is context free
Context-free languages are closed under the following operations. The Kleene star, the concatenation, the union and the intersection.
a) Only S1 is correct
b) Only S2 is correct
c) Both S1 and S2 are correct
d) None of S1 and S2 is correct
S1 can be written as (00)<sup>n</sup> where n >= 1. And S2 can be written as (00)<sup> (m+n)</sup> where m >=2 and n >= 1. S2 can be further reduced to (00)<sup>x</sup> where x >= 3. SO we can write regular grammars for both
a) 1(01)* and (10)*1
b) x (xx)* and (xx)*x
c) x+ and x+ x(*+)
d) All of the mentioned
Rule (pq)*p=p (qp)*
Items per page: