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.6k
- Engineering Mathematics 7.5k
- Digital Logic 3k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 5.9k
- Compiler Design 2.1k
- Databases 4.2k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 588
- Exam Queries 568
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,071 questions

53,206 answers

184,561 comments

70,424 users