PDA to accept a language of strings containing more a's than b's

Question

Produce a PDA to recognise the following language : the language of strings containing more a\'s than b\'s

I have been struggling with this

Answer 1

Basic infromation of transaction is given in below figure.

Here is the complete transaction.

In it є is equal to NULL. $ sign is pushed into stack at the start of the string and pop at the end to determine the string has been completely read and end now. qo is start state and q5 is final state

It is Non-deterministic push down Automata (NPDA).So Due to NPDA the transaction of rejection string is not shown in it.