下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved .