我正在学习PDA，我得到了如何为给定的绘制PDA追踪一组符号或字母表。但是，我不知道如何跟踪给定的PDA（书面形式），见下文。
所以这是一个书面的PDA：
Q={s0,f}
Σ={a,b,c}
Γ={S,X,a,b,c}
F={f}
δ={((s0,ε,ε),(f,S)),
((f,ε,S)(f,aSc)),
((f,ε,S)(f,X)),
((f,ε,X)(f,bXc)),
((f,ε,X)(f,ε)),
((f,a,a)(f,ε)),
((f,b,b)(f,ε)),
((f,c,c)(f,ε))
}
问的问题是：
Trace one possible computational path of your pushdown automaton from with
the input abccc. This string will not be accepted. Explain how you know that your computation has not accepted the input, that is, why the state and stack configuration after the input has been used up is not an accepting one.
答案是：
State Stack
s0 ε
f S
f aSc
f Sc
f Xc
f bXcc
f Xcc
f cc
f c
f ε
我不明白堆栈符号。我想如果堆栈末尾有一个ε输入被接受了：S？
如果有人能向我解释，我会非常感激
由于