Initialize an empty stack and empty result string variable.
初始化一个空堆栈,将结果字符串变量置空。
State 0 represents the empty stack, state 1 represents the stack with only one element: simpara.
状态0表示空堆栈,状态1表示只有一个元素:simpara的堆栈。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
应用推荐