Every regular language is also a CFL.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

Cfl is closed under intersection with regular language.

Then resultant languages will be regular or cfl ?

Let X is cfl

Y is regular language

L=X intersection Y

Then L is what?

Then resultant languages will be regular or cfl ?

Let X is cfl

Y is regular language

L=X intersection Y

Then L is what?

+1 vote

Best answer

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,903 questions

47,560 answers

146,297 comments

62,306 users