Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?
A) L1 n L2 is a deterministic CFL
B) L3 n L1 is recursive
C) L1 U L2 is context free
D) L1 n L2 n L3 is recursively enumerable
Correct Answer:
Verified
Q13: A minimum state deterministic finite automation accepting
Q14: If s is a string over (0
Q15: For S € (0+1)* let d(s)denote the
Q16: Let SHAM3 be the problem of finding
Q17: Consider the following statements about the context
Q19: Consider the regular language L =(111+11111)*. The
Q20: Consider the languages: GATE[2005]L1 = {wwR w
Q21: Consider the languages: L1 ={a^n b^n c^m
Q22: Let L1 be a recursive language, and
Q23: Consider the following two problems on undirected
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents