Worlds of David Darling
Encyclopedia of Science
   
Home > Encyclopedia of Science

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