Register

TOC CFL Closure property doubt

631 views
0 votes
0 votes
Is it viable possibility that L and L complement can both be CFL but not Regular?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
vaishali jhalani asked Dec 14, 2016
743 views
closure property of CFL
How to prove this.. CFL is closed under intersection with regular languages.
How to prove this..CFL is closed under intersection with regular languages.
User Avatar
4 votes
4 votes
2 answers
2
dd asked Aug 17, 2016
1,314 views
CFL closure property
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is (a) a DCFL (b) a recursive set but not CFL (c) a CFL but not DCFL (d) not a CFL
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is(a) a DCFL(b) a recursive set but not CFL(c) a CFL but not DCFL(d) not a CFL
User Avatar
2 votes
2 votes
1 answer
3
Souvik33 asked Nov 23, 2022
321 views
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
User Avatar
Link Copied!