Name: Anonymous 2011-11-09 1:43
Will somebody please help me with this problem? Yes, it is a homework problem, but I've been at it for days and am not making progress. Thanks /prog/
Prove L = {a^(n)b^(n) | n≥ 0} is a deterministic context-free language.
Prove L = {a^(n)b^(n) | n≥ 0} is a deterministic context-free language.