Design the PDA (push-down automata) accepting the language: 2^m 1^n 0^2n+3

=>

a) Draw a diagram of the automata (specifying states and transitions in the diagram)

b) Describe states and the behavior of PDA (push-down automata) in an informal way [describe in words what's the purpose of each state; in what circumstances automata changes its state]

b) Write the transition function (as triplets)

c) Using instantaneous descriptions show how this PDA accepts two sequences belonging to the language. Use instantaneous descriptions to show the behavior of PDA for input not belonging to the language.

Note: Indexes n, m in language definition are greater or equal to 1. Could anybody help me? I will thumbs up the good answer.

2m1"02n+3