First post on Mathematics ;)
I'm stucked with a problem related to automata theory / formal grammars. The problem ask the student to design a Pushdown automaton that accepts the complementary language of:
S-> (S) | SS | €
Wich I think is a pretty usual GFC example. The problem for me is that I'm not able to find information about the procedure to get the complementary language of that grammar. As I understand, complementary languages are defined as the substraction of the universal language and the words generated by the grammar, but this is a huge set!.
Thanks a lot!