in Theory of Computation
360 views
3 votes
3 votes
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$

And if $CFL$ can you write the equivalent $CFG$ for this ?
in Theory of Computation
360 views

2 Answers

1 vote
1 vote
My approach:

consider it as ${ww}$, the language will belongs to CSL

and if we complement it, $\overline{ww}$ so it must be CSL due to CSL is closed under complement.
edited by

1 comment

The question is if it is CFL or not – it is surely CSL.
0
0
1 vote
1 vote

 

complement(ww) This language is context free it was proved in the following paper:

Tomaszewski, Zach. "A Context-Free Grammar for a Repeated String." Journal of Information and Computer Science, 2012 (PDF).

 

 

4 Comments

Are you sure it was first proved in this paper (2012)?
0
0
I'm not sure if it was proven first in this paper πŸ˜…...just know that was
0
0
Because I remember studying this in college and it was before 2012 :)
0
0
πŸ˜…πŸ˜…πŸ˜… I was so sure I got this right when I was solving pyqs. Cuz you instantly think... cfl not closed under complementation. So it is CSL. well..it definitely is but it is ALSO cfl. Then I started googling why and how and found this and other same results
0
0

Related questions