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.5k
- Engineering Mathematics 7.3k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.4k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 568
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

48,445 questions

52,747 answers

183,345 comments

68,219 users