您要查找的是不是：
- asynchronous finite state machine(AFSM) 異步狀態(tài)機
- asynchronous finite state machine 異步有限自動(dòng)機
- What Exactly Is a Finite State Machine? 有限狀態(tài)機定義?
- Some finite state machines fall into this category, for example. 例如,一些有限狀態(tài)機屬于這一類(lèi)別。
- Therefore, the introduction of the finite state machine concepts. 為此，引入有限狀態(tài)機的概念。
- A finite state machine can only be in one state at any moment in time. 有限狀態(tài)機在任一時(shí)刻都只能夠處于一種狀態(tài)中。
- Example 8-8 gives a glimpse of finite state machines from Chapter 9. 例8-8小窺了一下第9章的有限狀態(tài)機。
- The finite state computer files, for example, Logon. Fsm, Fax. Fsm, and DtmfMainMenu. Fsm, do not exist. 有限狀態(tài)機文件(如Logon.;fsm、Fax
- The UMConfig. Xml file contains references to the name of all the finite state computer files. UMConfig.;xml文件包含對所有有限狀態(tài)機文件名的引用。
- For the feature of GUI and OO, A model based finite state machine(FSM) for conformance testing is presented. 一、針對C/S系統的GUI和OO特性，提出了基于有限狀態(tài)機(FSM)的一致性測試模型。
- High-level design intents such as finite state machine (FSM) and counter are commonly used in modern VLSI design. 高階設計資訊被廣泛的應用在現今超大型積體電路的設計上，如：有限狀態(tài)機、計數器等等。
- Petri Net, Finite State Automata (FSA), IDEF3 and State Charts are traditionally used for behavior modeling. Petri Net、有限自動(dòng)機、IDEF3和狀態(tài)圖是常用的行為建模方法。
- SMV -- checking finite state systems against specifications in temporal logic CTL. smv檢查在臨時(shí)邏輯CTL中的非規格有限系統。
- For every NFA a deterministic finite state machine (DFA) can be found that accepts the same language. 保持機器當前可能處在的所有狀態(tài)的集合數據結構。
- With the rapid development of EDA tools,rapid design finite state machine automation with CAD will co... 隨著(zhù)EDA工具的快速發(fā)展,通過(guò)CAD快速設計有限狀態(tài)機自動(dòng)化成為可能。
- Firstly，the EFSM induced by a Finite State Machine（FSM） and its language are introduced. 首先定義了有限狀態(tài)機（FSM）導出的EFSM及其產(chǎn)生的語(yǔ)言。
- The property to be checked is described as a finite state machine that transitions on atomic predicates, properties that can be identified by cursory look at the program. 所要檢查的特性被描述為一個(gè)有限狀態(tài)機器，即原子謂詞上的轉變，這樣粗略地查看程序就能識別出這些特性。
- Based on multiple patterns match algorithm-deterministic finite state automata (DFSA), a DFA has been designed, which can identify multiple kind numbers. 摘要基于有限自動(dòng)機的多模式匹配算法（DFSA算法），設計出同時(shí)識別多種數的有限自動(dòng)機。
- A design approach of finite state machine for survivability control system based on Boolean expression (BoolSFSM) is proposed. 文章提出一種基于布爾表達式的可生存性控制系統的有限狀態(tài)機的設計方法。
- The WSCL specification models a conversation as a finite state machine where state changes are triggered by interactions. WSCL規范使一個(gè)會(huì )話(huà)作為一個(gè)有限狀態(tài)機模型，狀態(tài)的轉移被相互作用所觸發(fā)。
