什么是语言a ^ mb ^ n的PDA（下推式自动机），其中n <m

Question

给定语言a到幂mb到幂n的下推自动机将如何变化，其中n小于ma ^ mb ^ n / n

Answer 1

[Let PDA is P:-(Q={q_0,q_1,q_2},𝛴={a,b},Δ,q_0,Z,F={q_2}) where Q=finite set of states. Δ=transition function Z=stack start symbol F=set of final states Transitions are //push a on stack 1. Δ(q_0,a,Z)=(q_0,aZ) 2. Δ(q_0,a,a)=(q_0,aa) //pop a for every b symbol encountered 3. Δ(q_0,b,a)=(q_1,ϵ) 4. Δ(q_1,b,a)=(q_1,ϵ) //when string is empty and 'a' symbol is still left on stack reach final state 5. Δ(q_1,ϵ,a)=(q_2,a)]