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]

What do you mean by 'a table'?

I mean a transition table which will show that after pushing or poping an input whether the given string is accepted or rejected.

Oh, so you just mean a table with two columns: input strings and acceptance/rejection?

Well, anyway, you should probably think about information storage. When you're partway through the string, what piece of information will you need to have retained about the previously read parts of the string? How are you going to represent that information? You have two places to represent that information: your current node within the graph of the automaton, and your stack. What piece of information do you need to retain and update each step of the way?

hey guys!!! anyone can help me how to design a PDA that ask a string and the output should be accepted. The entire input string must be read before the machine can accept the word. It is in any language!! thnk you