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. In Computer science and Automata theory, a state is a unique configuration of information in a program or machine A finite state machine is an abstract model of a machine with a primitive internal memory.
A state stores 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:
A FSM can be represented using a state diagram (or state transition diagram) as in figure 1 above. State diagrams is a Diagram used in the field of Computer science, representing the behavior of a system which is composed of a finite number of states Besides this, several state transition table types are used. In Automata theory and Sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton 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 also VFSM). The "virtual finite state machine" (VFSM is a concept promoted by SW Software and implemented in their StateWORKS product The "virtual finite state machine" (VFSM is a concept promoted by SW Software and implemented in their StateWORKS product
| Current State →|
|State A||State B||State C|
|Condition X||. . .||. . .||. . .|
|Condition Y||. . .||State C||. . .|
|Condition Z||. . .||. . .||. . .|
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, mathematics, and logic. Electrical engineering, sometimes referred to as electrical and electronic engineering, is a field of Engineering that deals with the study and application of Linguistics is the scientific study of Language, encompassing a number of sub-fields Computer science (or computing science) is the study and the Science of the theoretical foundations of Information and Computation and their Philosophy is the study of general problems concerning matters such as existence knowledge truth beauty justice validity mind and language Foundations of modern biology There are five unifying principles Mathematics is the body of Knowledge and Academic discipline that studies such concepts as Quantity, Structure, Space and Logic is the study of the principles of valid demonstration and Inference. A complete survey of their applications is outside the scope of this article. Finite state machines are a class of automata studied in automata theory and the theory of computation. The theory of computation is the branch of Computer science that deals with whether and how efficiently problems can be solved on a Model of computation, using an 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.
There are two different groups: Acceptors/Recognizers and Transducers.
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 languages - that is, a language is regular if there is some FSM that accepts it.
The start state is usually shown drawn with an arrow "pointing at it from nowhere" (Sipser (2006) p. 34).
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. In the Theory of computation, a deterministic finite state machine (also known as deterministic finite state automaton (DFSA or deterministic finite The binary numeral system, or base-2 number system, is a Numeral system that represents numeric values using two symbols usually 0 and 1.
S1 (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 generate output based on a given input and/or a state using actions. A finite-state transducer ( FST) is a Finite state machine with two tapes an input tape and an output tape They are used for control applications and in the field of computational linguistics. Computational linguistics is an Interdisciplinary field dealing with the statistical and/or rule-based modeling of Natural language from a computational Here two types are distinguished:
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 "Moore or Mealy model?"
A further distinction is between deterministic (DFA) and non-deterministic (NDFA, GNFA) automata. In the Theory of computation, a deterministic finite state machine (also known as deterministic finite state automaton (DFSA or deterministic finite In the Theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA is a Finite state machine where for each In the Theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA is a NFA where In deterministic automata, for each state there is exactly one transition for each possible input. In non-deterministic automata, there can be none 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.
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.
Depending on the type there are several definitions. An acceptor finite-state machine is a quintuple (Σ,S,s0,δ,F), where:
A transducer finite-state machine is a sextuple (Σ,Γ,S,s0,δ,ω), where:
If the output function is a function of a state and input alphabet () that definition corresponds to the Mealy model, and can be modelled as a Mealy machine. In the Theory of computation, a Mealy machine is a Finite state machine (and more accurately a Finite state transducer) that generates an output based If the output function depends only on a state () that definition corresponds to the Moore model, and can be modelled as a Moore machine. In the Theory of computation, a Moore machine is a Finite state automaton where the outputs are determined by the current state A finite-state machine with no output function at all is known as a semiautomaton or transition system. In Theoretical computer science, a semiautomaton is is an automaton having only an input and no output In Theoretical computer science, a state transition system is an Abstract machine used in the study of Computation.
Optimizing an FSM means finding the machine with the minimum number of states that performs the same function. One possibility is by using an Implication table or the Moore reduction procedure. An implication table is a tool used to facilitate the minimization of states in a State machine. The Moore reduction procedure is a method used for minimizing states in a State machine. Another possibility is bottom-up algorithm for Acyclic FSAs.
In a digital circuit, an FSM may be built using a programmable logic device, a programmable logic controller, logic gates and flip flops or relays. A circuit diagram (also known as an electrical diagram Wiring diagram, elementary diagram or electronic Schematic) is a simplified conventional pictorial representation Transistor–transistor logic ( TTL) is a class of Digital circuits built from Bipolar junction transistors (BJT and Resistors It is called Digital electronics are Electronics systems that use Digital signals Digital electronics are representations of Boolean algebra also see A programmable logic device or PLD is an electronic component used to build reconfigurable Digital circuits Unlike a Logic gate, which has a A programmable logic controller ( PLC) or programmable controller is a Digital computer used for Automation of industrial processes such as A logic gate performs a logical operation on one or more logic inputs and produces a single logic output In Digital circuits a flip-flop is a term referring to an Electronic circuit (a Bistable Multivibrator) that has two stable states and thereby A relay is an electrical Switch that opens and closes under the control of another Electrical circuit. More specifically, a hardware implementation requires a register to store state variables, a block of combinational logic which determines the state transition, and a second block of combinational logic that determines the output of an FSM. In Computer architecture, a processor register is a small amount of storage available on the CPU whose contents can be accessed more quickly than storage One of the classic hardware implementations is the Richard's Controller. The Richard’s Controller is a method of implementing a Finite state machine using simple integrated circuits and combinational logic
The following concepts are commonly used to build software applications with finite state machines:
Starting in the 1970s, Leslie Lamport, an early leader within the distributed systems research community, used finite state machines as the basis for an algorithm he called state machine replication. 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 The "virtual finite state machine" (VFSM is a concept promoted by SW Software and implemented in their StateWORKS product Automata-based programming is a Programming paradigm in which the program or its part is thought of as a model of a Finite state machine or any other (often more Dr Leslie Lamport (born February 7, 1941 in New York City) is an American computer scientist. Introduction from Schneider's 1990 survey "Distributed software is often structured in terms of clients and services In this approach, a deterministic computer program or service is replaced with a set of replicas that use some form of atomic broadcast to perform operations in a manner tolerant of failures.
Finite Markov-chain processes are also known as subshifts of finite type. In Mathematics, subshifts of finite type are used to model Dynamical systems, and in particular are the objects of study in Symbolic dynamics and Ergodic
|Type-0||Unrestricted||Recursively enumerable||Turing machine|
|n/a||(no common name)||Recursive||Decider|
|n/a||Tree-adjoining etc. A formal language is a set of words, ie finite strings of letters, or symbols. In Formal semantics, Computer science and Linguistics, a formal grammar (also called formation rules) is a precise description of a Formal Within the field of Computer science, specifically in the area of Formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger In Formal semantics, Computer science and Linguistics, a formal grammar (also called formation rules) is a precise description of a Formal A formal language is a set of words, ie finite strings of letters, or symbols. In Formal language theory an unrestricted grammar is a Formal grammar on which no restrictions are made on the left and right sides of the grammar's productions In Mathematics, Logic and Computer science, a recursively enumerable language is a type of Formal language which is also called partially Turing machines are basic abstract symbol-manipulating devices which despite their simplicity can be adapted to simulate the logic of any Computer Algorithm A recursive language in Mathematics, Logic and Computer science, is a type of Formal language which is also called recursive, A context-sensitive grammar (CSG is a Formal grammar in which the left-hand sides and right-hand sides of any Production rules may be surrounded by a context of In Theoretical computer science, a context-sensitive language is a Formal language that can be defined by a Context-sensitive grammar. A linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of a Non-deterministic Turing machine. An indexed grammar is a Formal grammar which describes Indexed languages They have three disjoint sets of symbols the usual terminals and nonterminals and the indices Indexed languages are a class of Formal languages discovered by Alfred Aho; they are described by Indexed grammars and can be recognized by Nested stack In Automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks Tree-adjoining grammar (TAG is a grammar formalism defined by Aravind Joshi.||(Mildly context-sensitive)||Embedded pushdown|
|n/a||Deterministic context-free||Deterministic context-free||Deterministic pushdown|
|Each category of languages or grammars is a proper subset of the category directly above it,|
and any automaton in each category has an equivalent automaton in the category directly above it. In Formal grammar theory mildly context-sensitive languages are a class of Formal languages which can be efficiently parsed but still possess enough context An embedded pushdown automaton or EPDA is a Computational model that parse languages in the Tree-adjoining grammar (TAG In Formal language theory, a context-free grammar ( CFG) is a grammar in which every production rule is of the form V &rarr In Formal language theory, a context-free language is a language generated by some Context-free grammar. In Automata theory, a pushdown automaton (PDA is a finite automaton that can make use of a stack containing data In Formal grammar theory the deterministic context-free grammars (DCFGs are a Proper subset of the Context-free grammars. A deterministic context-free language is a Formal language which is defined by a Deterministic context-free grammar. In Automata theory, a Pushdown automaton is a Finite automaton with an additional stack of symbols its transitions can take the top symbol on the stack Strictly regular grammars In Computer science, a right regular grammar (also called right linear grammar) is a Formal grammar ( N, A Regular language is said to be star-free if it can be described by a Regular expression constructed from the letters of the alphabet, the Empty set