Finite state automata (FSA) are devices that can be in one of a finite number of states, one of which is called the start state and one or more are called final states. Transitions are defined for each state when the FSA reads a symbol from an input language. If a word, or input string of symbols from the input language, is provided to the FSA and if it starts at a start state and arrives at a final state after reading the word, we say the word is accepted by the FSA. Languages of words accepted by FSA are called regular languages.

### Related categories 1

### Sites 2

Finite State Automata

An introduction to deterministic and nondeterministic FSA, with simple examples.

Nondeterministic Finite State Machines

A Wikipedia article on nondeterministic FSA.

Last update:

March 24, 2016 at 16:15:03 UTC
Copyright © 1998-2016 AOL Inc.

Built by CMBuild