Is there a way to get complement? Following is my solution for CFG of all strings that DON'T contain bbb.
S -> aA | aaB | aB | bA | bbA A -> aA| aB A -> epsilon B -> bA | bbA B -> epsilon
Is this right?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community
The complement of a context-free language isn't necessarily context-free so there's no general method to produce a grammar for the complement.