The equivalence of words language accepted by PDLA and generated by CFLG is proved.
下推格值自动机接受的词语言与上下文无关格值文法生成的词语言具有等价关系。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
应用推荐