Finite state automata accept both 00 and 11

The memory is limited by the number of states.ДЇSMs are studied in the more general field of automata theory.ДЄn example of a very simple mechanism that can be modeled by a state machine is a turnstile. This is because the FSM has limited memory. That is, there are tasks which an FSM can't do but a Turing machine can. In biology and artificial intelligence research, state machines or hierarchies of state machines have been used to describe neurological systems and in linguistics-to describe the grammars of natural languages.Д¬onsidered as an abstract model of computation, the finite state machine is weak it has less computational power than some other models of computation such as the Turing machine. Simple examples are vending machines which dispense products when the proper combination of coins are deposited, elevators which drop riders off at upper floors before going down, traffic lights which change sequence when cars are waiting, and combination locks which require the input of combination numbers in the proper order.ДЇinite-state machines can model a large number of problems, among which are electronic design automation, communication protocol design, language parsing and other engineering applications. The behavior of state machines can be observed in many devices in modern society which perform a predetermined sequence of actions depending on a sequence of events with which they are presented. A particular FSM is defined by a list of its states, and the triggering condition for each transition. It can change from one state to another when initiated by a triggering event or condition this is called a transition. 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 is conceived as an abstract machine that can be in one of a finite number of states.

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.

Finite state automata accept both 00 and 11