Hello,

can someone please help with solving this problem regarding push down automata. I am to write a table for the following problem.

L={number of a's in (X) is not equal to number of b's in (X)l X is {a,b,c}* }.

I could really use some help planning the it, so i can write it myself.

The components of PDA are:

q=current state

t=input symbol

s=stack top symbol

q'=next state

i=movement over input tape.

d=operation over stack.

the operations only include [. , push, pop]