Finite-state machine
De LibreFind
| Advanced search |
- About 4 results found and you can help!
A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is a mathematical model of computation used to design both computer programs and sequential logic circuits. It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition, this is called a transition. A particular FSM is defined by a list of its states, and the triggering condition for each transition.
- Related: Abstract state machines, Artificial intelligence, Control system, Control table, Decision table, DEVS, Extended finite-state machine, Hidden Markov model, Petri net, Pushdown automaton, Quantum finite automata, Recognizable language, Sequential logic, State diagram, Transition system, Tree automaton, Turing machine, UML state machine, SCXML
| Modeling a Simple AI behavior using a Finite State... Modeling a Simple AI behavior using a Finite State Machine blog.manuvra.com/.../ - Web |
| Free On-Line Dictionary of Computing Free On-Line Dictionary of Computing foldoc.doc.ic.ac.uk/.../foldoc.cgi?query=finite+state+machine - Web |
| NIST Dictionary of Algorithms and Data Structures NIST Dictionary of Algorithms and Data Structures www.nist.gov/dads/HTML/finiteStateMachine.html - Web |
Gallery for «Finite-state machine»
Average relevance
| Video lecture Video lecture video.google.com/videoplay?docid=-5837841629284334824 - Web |
