您要查找的是不是：
- A rule-driven algorithm based on an iterated finite state transducer is proposed in present research to automatically convert graphemes to corresponding phonemes. 可以使用基于规则驱动的迭代有限状态转录机来解决这一问题。
- On TM Statistical Reordering Model Weighted Finite State Transducer 机译统计语序模框模型权重有限态转换
- finite state transducer 有限状态变换器
- What Exactly Is a Finite State Machine? 有限状态机定义?
- The Researching of New Type Feedback Electricity State Transducer. 新型馈电状态传感器的研究。
- Some finite state machines fall into this category, for example. 例如,一些有限状态机属于这一类别。
- Therefore, the introduction of the finite state machine concepts. 为此，引入有限状态机的概念。
- A finite state machine can only be in one state at any moment in time. 有限状态机在任一时刻都只能够处于一种状态中。
- Example 8-8 gives a glimpse of finite state machines from Chapter 9. 例8-8小窥了一下第9章的有限状态机。
- The finite state computer files, for example, Logon. Fsm, Fax. Fsm, and DtmfMainMenu. Fsm, do not exist. 有限状态机文件(如Logon.;fsm、Fax
- The UMConfig. Xml file contains references to the name of all the finite state computer files. UMConfig.;xml文件包含对所有有限状态机文件名的引用。
- For the feature of GUI and OO, A model based finite state machine(FSM) for conformance testing is presented. 一、针对C/S系统的GUI和OO特性，提出了基于有限状态机(FSM)的一致性测试模型。
- High-level design intents such as finite state machine (FSM) and counter are commonly used in modern VLSI design. 高阶设计资讯被广泛的应用在现今超大型积体电路的设计上，如：有限状态机、计数器等等。
- Petri Net, Finite State Automata (FSA), IDEF3 and State Charts are traditionally used for behavior modeling. Petri Net、有限自动机、IDEF3和状态图是常用的行为建模方法。
- SMV -- checking finite state systems against specifications in temporal logic CTL. smv检查在临时逻辑CTL中的非规格有限系统。
- For every NFA a deterministic finite state machine (DFA) can be found that accepts the same language. 保持机器当前可能处在的所有状态的集合数据结构。
- With the rapid development of EDA tools,rapid design finite state machine automation with CAD will co... 随着EDA工具的快速发展,通过CAD快速设计有限状态机自动化成为可能。
- Firstly，the EFSM induced by a Finite State Machine（FSM） and its language are introduced. 首先定义了有限状态机（FSM）导出的EFSM及其产生的语言。
- 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. 所要检查的特性被描述为一个有限状态机器，即原子谓词上的转变，这样粗略地查看程序就能识别出这些特性。
- Based on multiple patterns match algorithm-deterministic finite state automata (DFSA), a DFA has been designed, which can identify multiple kind numbers. 摘要基于有限自动机的多模式匹配算法（DFSA算法），设计出同时识别多种数的有限自动机。
