Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the following languages.Q. Which one...
Start Learning for Free
Consider the following languages.
Q. Which one of the following statements is FALSE?
- a)L2 is context-free.
- b)L1 intersection L2 is context-free.
- c)Complement of L2 is recursive.
- d)Complement of L1 is context-free but not regular.
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider the following languages.Q. Which one of the following stateme...
(D) is false. L1 is regular, so its complement would also be regular. L1 is a regular language of the form 0^* 1^* 0^*. L2 on the other hand is a CFL as it can be derived from the following CFG L2 = {0^p 1^q 0^r | p,q,r>0 And p notEqualTo r} S -> AC|CA C -> 0C0|B A -> 0A|0 B -> 1B|epsilon If coming up with a CFG for L2 is difficult, one can intuitively see that by reducing it to a simpler problem. L2 is very similar to a known CFL L3 = {a^m b^l | m notEqualTo n}
(A) L2 is context free, which is true [CORRECT]
(B) L1 intersection L2 is context free, which is again true because L1 is a regular language and L2 is a CFL. RL union CFL is always a CFL. Hence [CORRECT]
(C) Complement of L2 is recursive, which is true due to the fact that complement of a CFL is CSL for sure (Context sensitive language), which in turn (CSL) is a subset of recursive languages. Hence [CORRECT]
(D) Complement of L1 is context free but not regular, which is false due to closure laws of regular languages. Complement of a RL is always a RL. Hence [INCORRECT]
(A) L2 is context free, which is true [CORRECT]
(B) L1 intersection L2 is context free, which is again true because L1 is a regular language and L2 is a CFL. RL union CFL is always a CFL. Hence [CORRECT]
(C) Complement of L2 is recursive, which is true due to the fact that complement of a CFL is CSL for sure (Context sensitive language), which in turn (CSL) is a subset of recursive languages. Hence [CORRECT]
(D) Complement of L1 is context free but not regular, which is false due to closure laws of regular languages. Complement of a RL is always a RL. Hence [INCORRECT]
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer?
Question Description
Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer?.
Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer?.
Solutions for Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer?, a detailed solution for Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? has been provided alongside types of Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider the following languages.Q. Which one of the following statements is FALSE?a)L2 is context-free.b)L1 intersection L2 is context-free.c)Complement of L2 is recursive.d)Complement of L1 is context-free but not regular.Correct answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup