Formal Languages and Automata

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.

>>6
Basically, >>7.

Q = {p,q,r}
SIGMA = {a,b}
GAMMA = {I,A}
F = {r}
Z = I
q0 = p
delta =
(p,a,I) -> (p,AI)
(p,a,A) -> (p,AA)
(p,epsilon,I) -> (q,I)
(p,epsilon,A) -> (q,A)
(q,1,A) -> (q,epsilon)
(q,epsilon,I) -> (r,I)