An automaton is a simple model of a computer.
There is no formal definition for "automaton"--instead,
there are various kinds of automata, each with it's own
Generally, an automaton
An automaton that computes a Boolean (yes-no) function is
called an acceptor.
Acceptors may be used as the membership criterion of a language.
- has some form of input,
- has some form of output,
- has internal states,
- may or may not have some form of storage,
- is hard-wired rather than programmable.
An automaton that produces more general output (typically a string)
is called a transducer.
Copyright © 1996 by David Matuszek
Last modified Jan 29, 1996