>have a theory of computation exam coming up in a few days
>still find context free grammars and proving them incredibly vague and unclear
Finite automatons, regex and PDAs i understand perfectly but for the love of me I cannot figure how to write a proper proof for a CFL
>still find context free grammars and proving them incredibly vague and unclear
Finite automatons, regex and PDAs i understand perfectly but for the love of me I cannot figure how to write a proper proof for a CFL
