edited by
566 views
0 votes
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?
edited by

2 Answers

Best answer
1 votes
1 votes
  1. CFL intersection REG ----> CFL is closed intersection with regular language . Means
  • intersection may be regular hence it is also cfl. 
  • Intersection may be cfl .

So it always gives CFL .but not above the  CFL .

selected by

Related questions

1 votes
1 votes
1 answer
1
Na462 asked Jan 13, 2019
1,035 views
Consider the following Statements :There Exist a non-deterministic CFL whose reversal is DCFL.There exist a non regular CSL whose Kleene Closure is regular.Which of follo...
3 votes
3 votes
1 answer
3