Dictionary.com

finite state machine

Save This Word!

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

QUIZZES

QUIZ YOURSELF ON PARENTHESES AND BRACKETS APLENTY!

Set some time apart to test your bracket symbol knowledge, and see if you can keep your parentheses, squares, curlies, and angles all straight!
Question 1 of 7
Let’s start with some etymology: What are the origins of the typographical word “bracket”?
The American Heritage® Science Dictionary Copyright © 2011. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.

Example sentences from the Web for finite state machine

See Today's Synonym