Advertisement
Advertisement
finite state machine
- A model of a computational system, consisting of a set of states (including a start state), an alphabet of symbols that serves as a set of possible inputs to the machine, and a transition function that maps each state to another state (or to itself) for any given input symbol. The machine operates by being fed a string of symbols, and moves through a series of states. The study of the computational power of finite state machines and other related machines is important in computer science and linguistics. The computational core of a Turing machine is a finite state machine.
- Also called finite state automaton
Advertisement
Word of the Day
[gal-uh-maw-free ]
Meaning and examplesStart each day with the Word of the Day in your inbox!
By clicking "Sign Up", you are accepting Dictionary.com Terms & Conditions and Privacy Policies.
Advertisement
Advertisement
Advertisement
Browse