 |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|
finite-state automaton
The simplest computing device. Although it is not nearly powerful enough to perform universal computation, it can recognize regular expressions. Finite-state automatons (FSAs) are defined by a state transition table that specifies how the FSA moves from one state to another when presented with a particular input. FSAs can be drawn as graphs.
Related category
• COMPUTERS, ARTIFICIAL INTELLIGENCE, AND CYBERNETICS
Also on this site:
Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History
Transport Concepts & Designs (partner site)