下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
本文主要研究了域自动机方法、带自动机方法以及基于历史等价和转换互模拟的最小化方法。
In this paper, we research region automata, zone automata and the method of state space minimization based on history equivalence and bisimulation transition.
研究了不确定有穷自动机NFA、确定有穷自动机FA、规范有穷自动机GFA的基本关系与等价转换；
The essential relationship and equal value transformation of Non-Finite Automat, Finite Automat and Gauge Finite Automat (abbreviated as NFA, FA & GFA) is studied.
本文通过对并行环境下非确定有限自动机和确定有限自动机的等价性和转换进行研究，详细分析了非确定有限自动机到确定有限自动机的并行转换方法及算法，并以实例给出了其间并行转化的过程。
This paper through to research the equivalence and conversion of NFA and DFA in parallel environment, labor the method of NFA convert to DFA, and give a example of the process of parallel conversion.
下推格值自动机接受的词语言与上下文无关格值文法生成的词语言具有等价关系。
The equivalence of words language accepted by PDLA and generated by CFLG is proved.
下推格值自动机接受的词语言与上下文无关格值文法生成的词语言具有等价关系。
The equivalence of words language accepted by PDLA and generated by CFLG is proved.
应用推荐