finite state造句
(1) Fig 2.1 shows a very simple finite state diagram.
(2) Finite State Grammars Although finite state grammars are weak they have been used in computational systems.
(3) The major failing with finite state grammars is their inability to deal with any dependencies that exist between non-adjacent words. 2.2.3.1.
(4) For implementing finite state machines.
(5) Therefore, the introduction of the finite state machine concepts.
(6) Finally, the finite state machine - based video watermarking resistant to temporal synchronization attacks was discussed.
(7) The method of finite state machine together with PWM circuit is given to realize the algorithms of Voltage Space Vector control and 120 electrical angle changing phase control of DC brushless motor .
(8) Petri Net, Finite State Automata ( FSA ) , IDEF 3 and State Charts are traditionally used for behavior modeling.
(9) Finite state machine (FSM) is a reflection of VLSI control path, and its automatic synthesis becomes a very important step of design automation (DA).
(10) A formal characterization of SDG, as a finite state transition system, is extended and transformed firstly, and SMV module is modeled.
(11) Studies issues in the finite state machine ( FSM ) design in PCI bus interface controllers.
(12) Pulse distributing is designed by finite state machine and the PWM realizes step angles subdivided control.
(13) Example 8 - 8 gives a glimpse of finite state machines from Chapter 9.
(14) In chapter two, the basic knowledges of finite state automata and finite homogeneous Markov chain are introduce.
(15) Finite state machines use hardly any precious processor time because they essentially follow hard-coded rules.
(16) A finite state machine can only be in one state at any moment in time.
(17) It uses finite state machine, and supports encryption, decryption and key expansion.
(18) Finite state machines ( FSMs ) provide a powerful way for modeling reactive systems.
(19) A new method of protocol analysis is presented, in which a finite state automation with counters(CFSA)is applied to model the protocol to be analyzed and reachability analysis is made.
(20) No actions or transition are needed in this situation; you just want the finite state machine to ignore mouseout events in Inactive state, as shown in Listing 5.
(21) To remedy the defect of User Datagram Protocol(UDP) transmission in reliability, this paper proposes a design method using Finite State Machine(FSM) to control UDP transmission data.
(22) There were two experiments in the research, one was difficult artificial finite state grammar test, and the other was easy bi-conditional grammer test.
(23) Model checking is a formal verification by exhaustive search to finite state automata.
(24) A state assignment based algorithm is presented for power and area optimization of finite state machines.
(25) The agglutinative and rule-based nature of word formations in Uyghur allows modelling of the morphological structure of language in Finite State Machines(FSMs).
(26) This paper presents a formal approach to specify security model based on the theory of finite state machine(FSM) and the concept of communicating sequential process (CSP).
(27) This paper discusses techniques of protocol specification and verification based on Finite State Machine (FSM).
(28) This paper presents an interoperability test generation method based on the formal model, Communicating Multiport Finite State Machines.
(29) Firstly constructing lexical analyzer of our system by using analysis strategy of finite state automaton (DFA).
(30) The object prototype is a good place to define nearly everything related to the finite state machine: the state table, its actions, and their parameters.
12