Reputation: 411
I'm trying to construct a CFG from this language:
{a^n b c^2n | n >= 1}
and if I understood it right, I got
S->aA, A->bcB, B->cS|c
but even if this would be correct, I weren't sure how to make a CFG in Chomsky Normal Form from this. Every rule I know already applies to this. So I think I made a mistake with my first CFG?
Upvotes: 0
Views: 170