Which of the following is/are CFL not closed under? – McqOptions

MCQOPTIONS

1.	Which of the following is/are CFL not closed under?
A.	Reverse
B.	Homomorphism
C.	Inverse Homomorphism
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

There is a linear grammar that generates a context free grammar
A___________ is context free grammar with atmost one non terminal in the right handside of the production.
If L1 and L2 are context free languages, L1-L2 are context free:
Which of the following is incorrect?There exists algorithms to decide if:
Given Grammar G1:S->aSbS->eGrammar G2:R->cRdR->eIf L(G)=L(G1) U L(G2), the number of productions the new starting variable would have:
THERE_IS_A_LINEAR_GRAMMAR_THAT_GENERATES_A_CONTEXT_FREE_GRAMMAR?$
A____________IS_CONTEXT_FREE_GRAMMAR_WITH_ATMOST_ONE_NON_TERMINAL_IN_THE_RIGHT_HANDSIDE_OF_THE_PRODUCTION.?$
If L1 and L2 are context free languages, L1-L2 are context free?
Which of the following is/are CFL not closed under?
Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.