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.3k
- Engineering Mathematics 5.4k
- Digital Logic 2.1k
- Programming & DS 3.9k
- Algorithms 3.4k
- Theory of Computation 4.2k
- Compiler Design 1.6k
- Databases 3.1k
- CO & Architecture 2.7k
- Computer Networks 3.1k
- Non GATE 1.1k
- Others 1.4k
- Admissions 501
- Exam Queries 448
- Tier 1 Placement Questions 19
- Job Queries 62
- Projects 12

37,964 questions

45,466 answers

131,324 comments

48,379 users