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

QUIZZES

TAKE THIS QUIZ TO SEE WHAT YOU KNOW ABOUT 2ND-3RD GRADE VOCAB FROM BOOKS!

Are you learning new vocabulary? Or do you just have an interest in words? Either way, this quiz is for you.
Question 1 of 10
orchard
The American Heritage® Science Dictionary Copyright © 2011. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.