- Finite state machine
A

**finite state machine (FSM)**or**finite state automaton**(plural: "automata") or simply a**state machine**, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an abstract model of a machine with a primitive internal memory.**Concepts and vocabulary**A current "state" is determined by past states of the system. As such, it can be said to record information about the past, i.e. it reflects the input changes from the system start to the present moment. A "transition" indicates a state change and is described by a condition that would need to be fulfilled to enable the transition. An "action" is a description of an activity that is to be performed at a given moment. There are several action types:;Entry action: which is performed "when entering" the state;Exit action: which is performed "when exiting" the state;Input action: which is performed depending on present state and input conditions;Transition action: which is performed when performing a certain transition

An FSM can be represented using a

state diagram (or state transition diagram) as in figure 1 above. Besides this, severalstate transition table types are used. The most common representation is shown below: the combination of current state (B) and condition (Y) shows the next state (C). The complete actions information can be added only using footnotes. An FSM definition including the full actions information is possible using state tables (see alsoVFSM ).In addition to their use in modeling reactive systems presented here, finite state automata are significant in many different areas, including

electrical engineering ,linguistics ,computer science ,philosophy ,biology ,mathematic s, andlogic . A complete survey of their applications is outside the scope of this article. Finite state machines are a class of automata studied inautomata theory and thetheory of computation .In computer science, finite state machines are widely used in modeling of application behavior, design of hardware digital systems, software engineering, compilers, network protocols, and the study of computation and languages.**Classification**There are two different groups: Acceptors/Recognizers and Transducers.

**Acceptors and recognizers****Acceptors**and**recognizers**(also**sequence detectors**) produce a binary output, saying either "yes" or "no" to answer whether the input is accepted by the machine or not. All states of the FSM are said to be either accepting or not accepting. At the time when all input is processed, if the current state is an accepting state, the input is accepted; otherwise it is rejected. As a rule the input are symbols (characters); actions are not used. The example in figure 2 shows a finite state machine which accepts the word "nice". In this FSM the only accepting state is number 7.The machine can also be described as defining a language, which would contain every word accepted by the machine but none of the rejected ones; we say then that the language is "accepted" by the machine. By definition, the languages accepted by FSMs are the

regular language s - that is, a language is regular if there is some FSM that accepts it.**Start state**The start state is usually shown drawn with an arrow "pointing at it from nowhere" (Sipser (2006) p.34).

**Accept state**An

**accept state**(sometimes referred to as an**accepting state**) is a state at which the machine has successfully performed its procedure. It is usually represented by a double circle.An example of an accepting state appears on the left in this diagram of a

deterministic finite automaton (DFA) which determines if the binary input contains an even number of 0s."S"

_{1}(which is also the start state) indicates the state at which an even number of 0s has been input and is therefore defined as an accepting state. This machine will give a correct end state if the binary number contains an even number of zeros including a string with no zeros. Examples of strings accepted by this DFA are epsilon (the empty string), 1, 11, 11..., 00, 010, 1010, 10110 and so on.**Transducers**Transducers generate output based on a given input and/or a state using actions. They are used for control applications and in the field of

computational linguistics . Here two types are distinguished:;

Moore machine : The FSM uses only entry actions, i.e. output depends only on the state. The advantage of the Moore model is a simplification of the behaviour. The example in figure 1 shows a Moore FSM of an elevator door. The state machine recognizes two commands: "command_open" and "command_close" which trigger state changes. The entry action (E:) in state "Opening" starts a motor opening the door, the entry action in state "Closing" starts a motor in the other direction closing the door. States "Opened" and "Closed" don't perform any actions. They signal to the outside world (e.g. to other state machines) the situation: "door is open" or "door is closed".;

Mealy machine : The FSM uses only input actions, i.e. output depends on input and state. The use of a Mealy FSM leads often to a reduction of the number of states. The example in figure 4 shows a Mealy FSM implementing the same behaviour as in the Moore example (the behaviour depends on the implemented FSM execution model and will work e.g. for virtual FSM but not for event driven FSM). There are two input actions (I:): "start motor to close the door if command_close arrives" and "start motor in the other direction to open the door if command_open arrives".In practice mixed models are often used.

More details about the differences and usage of Moore and Mealy models, including an executable example, can be found in the external technical note [

*http://www.stateworks.com/active/content/en/technology/technical_notes.php#tn10 "Moore or Mealy model?"*]A further distinction is between

**deterministic**(DFA) and**non-deterministic**(NDFA,GNFA ) automata. In deterministic automata, for each state there is exactly one transition for each possible input. In non-deterministic automata, there can be none, one, or more than one transition from a given state for a given possible input. This distinction is relevant in practice, but not in theory, as there exists an algorithm which can transform any NDFA into an equivalent DFA, although this transformation typically significantly increases the complexity of the automaton.The FSM with only one state is called a combinatorial FSM and uses only input actions. This concept is useful in cases where a number of FSM are required to work together, and where it is convenient to consider a purely combinatorial part as a form of FSM to suit the design tools.

**FSM logic**The next state and output of an FSM is a function of the input and of the current state. The FSM logic is shown in Figure 5.

**Mathematical model**Depending on the type there are several definitions. An

**acceptor**finite-state machine is a quintuple $(Sigma,\; S,\; s\_0,\; delta,\; F)$, where:

*$Sigma$ is the input alphabet (a finite, non-empty set of symbols).

*$S$ is a finite, non-empty set of states.

*$s\_0$ is an initial state, an element of $S$. In aNondeterministic finite state machine , $s\_0$ is a set of initial states.

*$delta$ is the state-transition function: $delta:\; S\; imes\; Sigma\; ightarrow\; S$.

*$F$ is the set of final states, a (possibly empty) subset of $S$.A

finite state transducer is a sextuple $(Sigma,\; Gamma,\; S,\; s\_0,\; delta,\; omega)$, where:

*$Sigma$ is the input alphabet (a finite non empty set of symbols).

*$Gamma$ is the output alphabet (a finite, non-empty set of symbols).

*$S$ is a finite, non-empty set of states.

*$s\_0$ is the initial state, an element of $S$. In aNondeterministic finite state machine , $s\_0$ is a set of initial states.

*$delta$ is the state-transition function: $delta:\; S\; imes\; Sigma\; ightarrow\; S$.

*$omega$ is the output function.If the output function is a function of a state and input alphabet ($omega:\; S\; imes\; Sigma\; ightarrow\; Gamma$) that definition corresponds to the

**Mealy model**, and can be modelled as aMealy machine . If the output function depends only on a state ($omega:\; S\; ightarrow\; Gamma$) that definition corresponds to the**Moore model**, and can be modelled as aMoore machine . A finite-state machine with no output function at all is known as asemiautomaton ortransition system .**Optimization**Optimizing an FSM means finding the machine with the minimum number of states that performs the same function. The fastest known algorithm doing this is the Hopcroft minimization algorithm.ref|hopcroft1ref|AlmeidaEtAl. Other techniques include using an

Implication table , or theMoore reduction procedure . Additionally, acyclic FSAs can be optimized using a simple bottom up algorithmref|minimization1.**Implementation****Hardware applications**.

**Software applications**The following concepts are commonly used to build software applications with finite state machines:

*event driven FSM

*virtual FSM (VFSM)

*Automata-Based Programming **ee also**

*Abstract state machine

*Decision tables

*Extended finite state machine

*Finite state machine with datapath

*Petri net

*Pushdown automaton

*Quantum finite automata

*Sequential logic

*Statechart

*Transition system

*Turing machine

*Hidden Markov model

*Ant Wars

*Game AI

*SCXML **External links*** [

*http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?query=finite+state+machine Description from the Free On-Line Dictionary of Computing*]

*NIST Dictionary of Algorithms and Data Structures [*http://www.nist.gov/dads/HTML/finiteStateMachine.html entry*]

* [*http://www.eventhelix.com/RealtimeMantra/HierarchicalStateMachine.htm Hierarchical State Machines*]

* [*http://www.troyworks.com/cogs/ COGs*] - Cogs is a open source, small FSM and HSM ( hierarchical state machine) library for use with Flash / Flex Actionscript 3.0 projects. An introductory talk [*http://link.brightcove.com/services/player/bcpid1733261879?bclid=1729365228&bctid=1743215121 here*]

* [*http://sourceforge.net/projects/fsmgenerator/ FSM Generator*] - FSMGenerator is a turn-key solution for FSM (Finite State Machine) automatic generation and integration within user's software

* [*http://sourceforge.net/projects/fsmdesigner/ FSM Designer*] - An open-source tool for the graphical development of FSMs and automatic Verilog code generation

* [*http://www.intelliwizard.com Round-trip Engineering State Machines*]

* [*http://www.sccs.swarthmore.edu/users/06/adem/engin/e15/lab4/ Using state machines in practical applications*]

* [*http://leotools.atwebpages.com/ Tool for design and visualization of Finite State Machines*]

* [*http://www.sinelabore.com sinelaboreRT*] - generates human readable c-code from state-charts especially targeting embedded real-time systems

* [*http://www.augeas.net/libfa/index.html libfa*] - An open-source C library for automata computations

* [*http://smc.sourceforge.net/ The State Machine Compiler*] - A tool to model and compile statemachines for a number of languages; java, C# etc. As well as display them as graphically.

* [*http://www.cs.jhu.edu/~hajic/courses/cs226/alg.html bottom-up algorithm for Acyclic FSAs*] - FSM minimization algorithms.

* [*http://www.state-machine.com Quantum Leaps*] - Provider of open source, state machine-based frameworks. Includes several examples and C/C++ code.

* [*http://gfsm.sourceforge.net gFSM*] - An open source implementation of FSM (Finite State Machine) programming framework in C.

* [*http://vaucanson.lrde.epita.fr Vaucanson*] - An open source C++ finite state machine manipulation platform, consisting of a library and tools implemented on top of it.

* [*http://unimod.sf.net UniMod*] - An open source plugin for Eclipse for automata-based programming.**References****General***Wagner, F., "Modeling Software with Finite State Machines: A Practical Approach", Auerbach Publications, 2006, ISBN 0-8493-8086-3.

*Samek, M., [*http://www.state-machine.com/psicc1/ "Practical Statecharts in C/C++"*] , CMP Books, 2002, ISBN 1-57820-110-1.

*Samek, M., [*http://www.state-machine.com/psicc2/ "Practical UML Statecharts in C/C++, 2nd Edition"*] , Newnes, 2008, ISBN 0-75068-706-1.

*Gardner, T., [*http://www.troyworks.com/cogs/ "Advanced State Management"*] , 2007 [*http://link.brightcove.com/services/player/bcpid1733261879?bclid=1729365228&bctid=1743215121 "(video at 360Flex 2008)"*]

*Cassandras, C., Lafortune, S., "Introduction to Discrete Event Systems". Kluwer, 1999, ISBN 0-7923-8609-4.

*Timothy Kam, "Synthesis of Finite State Machines: Functional Optimization". Kluwer Academic Publishers, Boston 1997, ISBN 0-7923-9842-4

*Tiziano Villa, "Synthesis of Finite State Machines: Logic Optimization". Kluwer Academic Publishers, Boston 1997, ISBN 0-7923-9892-0

*Carroll, J., Long, D. , "Theory of Finite Automata with an Introduction to Formal Languages". Prentice Hall, Englewood Cliffs, 1989.

*Kohavi, Z., "Switching and Finite Automata Theory". McGraw-Hill, 1978.

*Gill, A., "Introduction to the Theory of Finite-state Machines". McGraw-Hill, 1962.

*Ginsburg, S., "An Introduction to Mathematical Machine Theory". Addison-Wesley, 1962.**Finite state machines (automata theory) in theoretical computer science***cite book | last = Arbib | first = Michael A. | coauthors = | title = Theories of Abstract Automata | edition = 1st ed. | publisher = Prentice-Hall, Inc. | location = Englewood Cliffs, N.J. | year = 1969| ISBN 0-13-913368-2

*cite book | last =Bobrow | first = Leonard S. | coauthors = Michael A. Arbib| title = Discrete Mathematics: Applied Algebra for Computer and Information Science | edition = 1st ed. | publisher = W. B. Saunders Company, Inc. | location = Philadelphia | year = 1974| ISBN 0-7216-1768-9

*cite book | last = Booth| first = Taylor L. | coauthors = | title = Sequential Machines and Automata Theory | edition = 1st | publisher = John Wiley and Sons, Inc. | location = New York | year = 1967| id = Library of Congress Card Catalog Number 67-25924 Extensive, wide-ranging book meant for specialists, written for both theoretical computer scientists as well as electrical engineers. With detailed explanations of state minimization techniques, FSMs, Turing machines, Markov processes, and undecidability. Excellent treatment of Markov processes.

*cite book | last = Boolos | first = George | coauthors = Richard Jeffrey | title = Computability and Logic | edition = 3rd ed. | publisher = Cambridge University Press | location = Cambridge, England | year = 1989, 1999| id = ISBN 0-521-20402-X Excellent. Has been in print in various editions and reprints since 1974 (1974, 1980, 1989, 1999).

*cite book | last = Brookshear | first = J. Glenn | title = Theory of Computation: Formal Languages, Automata, and Complexity | year = 1989 | publisher = Benjamin/Cummings Publish Company, Inc. | location = Redwood City, California | id = ISBN 0-8053-0143-7 Approaches

Church-Turing thesis from three angles: levels of finite automata as acceptors of formal languages, primitive and partial recursive theory, and power of bare-bones programming languages to implement algorithms, all in one slim volume.*cite book | last = Davis| first = Martin | coauthors = Ron Sigal, Elaine J. Weyuker| title = Second Edition: Computability, Complexity, and Languages and Logic: Fundamentals of Theoretical Computer Science | edition = 2nd ed. | publisher = Academic Press, Harcourt, Brace & Company| location = San Diego | year = 1994| ISBN 0-12-206382-1

* Hopcroft, John E (1971). An n log n algorithm for minimizing states in a finite automaton [ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/71/190/CS-TR-71-190.pdf]

*cite book | last = Hopcroft | first = John | coauthors = Jeffrey Ullman| title = Introduction to Automata Theory, Languages and Computation | edition = 1st ed. | publisher = Addison-Wesley | location = Reading Mass | year = 1979| | id = ISBN 0-201-02988-X A difficult book centered around the issues of machine-interpretation of "languages", NP-Completeness, etc.

*cite book | last = Hopcroft | first = John E.| coauthors = Rajeev Motwani, Jeffrey D. Ullman| title = Introduction to Automata Theory, Languages, and Computation| edition = 2nd ed. | publisher = Addison-Wesley | location = Reading Mass | year = 2001| ISBN 0-201-44124-1 Distinctly different and less intimidating than the first edition.

*cite book | last = Hopkin | first = David | coauthors = Barbara Moss| title = Automata | edition = | publisher = Elsevier North-Holland | location = New York | year = 1976| id = ISBN 0-444-00249-9

*cite book | last = Kozen | first = Dexter C. | coauthors = | title = Automata and Computability | edition = 1st ed. | publisher = Springer-Verlag | location = New York | year = 1997|id = ISBN 0-387-94907-0

*cite book | last = Lewis| first = Harry R.| coauthors = Christos H. Papadimitriou| title = Elements of the Theory of Computation | edition = 2nd | publisher = Prentice-Hall | location = Upper Saddle River, New Jersey | year = 1998| id = ISBN 0-13-262478-8

*cite book | last = Linz| first = Peter| coauthors = | title = Formal Languages and Automata | edition = 4th | publisher = Jones and Bartlett | location = Sudbury, MA | year = 2006| id = ISBN-13: 978-0-7637-3798-6

*cite book | last = Minsky| first = Marvin| coauthors = | title = Computation: Finite and Infinite Machines| edition = 1st | publisher = Prentice-Hall | location = New Jersey | year = 1967| id = Minsky spends pages 11-20 defining what a “state” is in context of FSMs. His state diagram convention is unconventional. Excellent, i.e. relatively readable, sometimes funny.

*

*cite book | last = Pippenger| first = Nicholas| coauthors = | title = Theories of Computability| edition = 1st | publisher = Cambridge University Press| location = Cambridge, England | year = 1997| id = 0-521-55380-6 (hc) Abstract algebra is at the core of the book, rendering it advanced and less accessible than other texts.

*cite book | last = Rodger| first = Susan| coauthors = Thomas Finley| title = JFL

edition = 1st | publisher = Jones and Bartlett | location = Sudbury, MA | year = 2006| id = ISBN-10: 0763738344*cite book | last = Sipser| first = Michael | coauthors = | title = Introduction to the Theory of Computation, Second Edition | edition = 2nd | publisher = Thomson Course Technology | location = Boston Mass | year = 2006| id = ISBN-10: 0-534-95097-3 cf Finite state machines (finite automata) in chapter 29.

*cite book | last = Wood| first = Derick | coauthors = | title = Theory of Computation | edition = 1st | publisher = Harper & Row, Publishers, Inc.| location = New York | year = 1987| id = ISBN-10: 0-06-047208-1

* Almeida, Marco; Moreira, Nelma; Reis, Rogerio (2007). On the performance of automata minimization algrotims. [

*http://www.dcc.fc.up.pt/dcc/Pubs/TReports/TR07/dcc-2007-03.pdf*]**Abstract state machines in theoretical computer science***Yuri Gurevich (2000), "Sequential Abstract State Machines Capture Sequential Algorithms", ACM Transactions on Computational Logic, vl. 1, no. 1 (July 2000), pages 77-111. http://research.microsoft.com/~gurevich/Opera/141.pdf

**Machine learning using finite-state algorithms***cite book | last = Mitchell| first = Tom M. | coauthors = | title = Machine Learning | edition = 1st | publisher = WCB/McGraw-Hill Corporation | location = New York | year = 1997| id = ISBN 0-07-042807-7 A broad brush but quite thorough and sometimes difficult, meant for computer scientists and engineers. Chapter 13 "Reinforcement Learning" deals with robot-learning involving state-machine-like algorithms.

**Hardware engineering: state minimization and synthesis of sequential circuits***cite book | last = Booth| first = Taylor L. | coauthors = | title = Sequential Machines and Automata Theory | edition = 1st | publisher = John Wiley and Sons, Inc. | location = New York | year = 1967| id = Library of Congress Card Catalog Number 67-25924 Extensive, wide-ranging book meant for specialists, written for both theoretical computer scientists as well as electrical engineers. With detailed explanations of state minimization techniques, FSMs, Turing machines, Markov processes, and undecidability. Excellent treatment of Markov processes.

*cite book | last = Booth| first = Taylor L. | coauthors = | title = Digital Networks and Computer Systems| edition = 1st | publisher = John Wiley and Sons, Inc. | location = New York | year = 1971| id = ISBN 0-471-08840-4 Meant for electrical engineers. More focused, less demanding than his earlier book. His treatment of computers is out-dated. Interesting take on definition of ‘algorithm’.

*cite book | last = McCluskey| first = E. J. | coauthors = | title = Introduction to the Theory of Switching Circuits | edition = 1st | publisher = McGraw-Hill Book Company, Inc. | location = New York | year = 1965| id = Library of Congress Card Catalog Number 65-17394 Meant for hardware electrical engineers. With detailed explanations of state minimization techniques and synthesis techniques for design of combinatory logic circuits.

*cite book | last = Hill| first = Fredrick J. | coauthors =Gerald R. Peterson | title = Introduction to the Theory of Switching Circuits | edition = 1st | publisher = McGraw-Hill Book Company | location = New York | year = 1965| id = Library of Congress Card Catalog Number 65-17394 Meant for hardware electrical engineers. Excellent explanations of state minimization techniques and synthesis techniques for design of combinatory and sequential logic circuits.**Finite Markov chain processes**::"We may think of a

Markov chain as a process that moves successively through a set of states s1, s2, ..., sr. ... if it is in state si it moves on to the next stop to state sj with probability pij. These probabilities can be exhibited in the form of a transition matrix" (Kemeny (1959), p. 384)Finite Markov-chain processes are also known assubshifts of finite type .*cite book | last = Booth| first = Taylor L. | coauthors = | title = Sequential Machines and Automata Theory | edition = 1st | publisher = John Wiley and Sons, Inc. | location = New York | year = 1967| id = Library of Congress Card Catalog Number 67-25924 Extensive, wide-ranging book meant for specialists, written for both theoretical computer scientists as well as electrical engineers. With detailed explanations of state minimization techniques, FSMs, Turing machines, Markov processes, and undecidability. Excellent treatment of Markov processes.

*cite book | last = Kemeny| first = John G. | coauthors = Hazleton Mirkil, J. Laurie Snell, Gerald L. Thompson | title = Finite Mathematical Structures| edition = 1st | publisher = Prentice-Hall, Inc. | location = Englewood Cliffs, N.J. | year = 1959| id = Library of Congress Card Catalog Number 59-12841 Classical text . cf Chapter 6 ‘’Finite Markov Chains”.

*Wikimedia Foundation.
2010.*

### См. также в других словарях:

**Finite-state machine**— State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia**Finite-State-Machine**— Abb.1 Beispiel eines EA Ein endlicher Automat (EA, auch Zustandsmaschine, englisch finite state machine (FSM)) ist ein Modell des Verhaltens, bestehend aus Zuständen, Zustandsübergängen und Aktionen. Ein Automat heißt endlich, wenn die Menge der… … Deutsch Wikipedia**Finite State Machine**— Abb.1 Beispiel eines EA Ein endlicher Automat (EA, auch Zustandsmaschine, englisch finite state machine (FSM)) ist ein Modell des Verhaltens, bestehend aus Zuständen, Zustandsübergängen und Aktionen. Ein Automat heißt endlich, wenn die Menge der… … Deutsch Wikipedia**finite state machine**— baigtinis automatas statusas T sritis automatika atitikmenys: angl. finite automaton; finite state machine vok. endlicher Automat, m; Finalautomat, m rus. конечный автомат, m pranc. automate final, m; automate fini, m; automate terminal, m;… … Automatikos terminų žodynas**Deterministic finite-state machine**— An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia**Nondeterministic finite-state machine**— In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia**Nondeterministic finite state machine**— In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia**Event-driven finite state machine**— In computation, a finite state machine (FSM) is event driven if the creator of the FSM intends to think of the machine as consuming events or messages. This is in contrast to the parsing theory origins of the term finite state machine where the… … Wikipedia**Extended finite state machine**— In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an extended finite state machine (EFSM) model, the transition can be expressed by an “if… … Wikipedia**Virtual finite state machine**— The virtual finite state machine (VFSM) is a concept promoted by [http://www.stateworks.com SW Software] and implemented in their StateWORKS product. A VFSM is a finite state machine (FSM) defined in a virtual environment. The VFSM concept… … Wikipedia