Hi,
Ok, nothing too serious, but just a quick question as I think the authors made a small, although unimportant mistake(or maybe I'm somewhere missing the plot )- Theorem 30, I think, in chapter 15 concerns all CFG's can be converted into a PDA, but the CFG must be in CNF. So then why is there a paragraph on including the empty string, as a CFG in CNF contains no empty strings?
As I said nothing important, but ja, maybe someone can so me the light...