1) deterministic finite automata
确定状态机
1.
Delayed input deterministic finite automata(D~2FA) reduces the transition edges of deterministic finite automata(DFA) by introducing default edges.
Delayed input DFA(D~2FA)中引入默认边来对确定状态机(DFA)进行状态转移精简。
2.
Delayed input deterministic finite automata(D2FA) reduces the transition edges of deterministic finite automata(DFA) by introducing default edges.
Delayed input DFA(D2FA)中引入默认边来对确定状态机(DFA)进行状态转移精简。
2) DFSM
确定有限状态机
1.
The representation of the process of simplification of DFSM is researched,the disadvantage of the linear sequential representation are pointed out,the representation of the process of simplification of DFSM called simplification tree are given,which is intuitionistic and effective.
文章讨论确定有限状态机(DFSM)简化过程的表示问题,指出传统的线性顺序法存在直观性差、层次不分明、难于理解的不足,提出简化树法,它具有直观、有效的特点。
3) non-deterministic finite state machine
非确定性状态机
4) states determination
状态确定
1.
States Determination for Double Satellites Formation Constellation with GPS and GPS-like Ranging Technology;
联合GPS和类GPS测距技术实现双星编队星座的状态确定
5) State determination
状态确定
1.
Precise State Determination of Formation Satellite for Earth Observation Using GPS;
然而，为了进一步提高相对状态确定的精度，并且快速实现GPS星间载波相位差分的整周模糊度的确定，需增加另外的测量手段，方法之一是采用一种类似GPS的载波相位和伪码交联测距技术。
6) deterministic finite automation (DFA)
确定的有限状态自动机
补充资料：确定
1.固定。 2.明确肯定。 3.坚定。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条