McqMate

Q. |
## If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language? |

A. | L1 L2 |

B. | L1 ∩ L2 |

C. | L1 ∩ R |

D. | L1 ∪ L2 |

Answer» B. L1 ∩ L2 |

2.2k

0

Do you find this helpful?

13

View all MCQs in

Theory of ComputationNo comments yet

- Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
- Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
- Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
- Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
- Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
- The languages -------------- are the examples of non regular languages.
- A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
- Languages are proved to be regular or non regular using pumping lemma.
- Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
- Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is: