What happens to the T ?
Prove that the following languages are context-free by giving grammars that accept them
I am not sure if this valid, but this is my proof :
The set } is context –free. We construct a CFG to prove this proposition.
Let Σ={ …, }, then the following CFG accepts S.
S→ | |…| | ϵ
→ |
→ |
…
→ |
Hey, so there is another problem where I have to show that the complement of the above set, is also recognized by some CFG. I am kind of stuck trying to come up with some proof. Can you provide some hints or some idea on how to go about this construction. Thanks