下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
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.
应用推荐