114 ;;Quote: the finite automaton is a better approximation to physical machines than are Turing machines; e.g., Kleene's regular events and McCulloch and Pitts nerve-nets

115 ;;Quote: an automaton is a black box that answers "yes" or "no" to arbitrary, finite sequences of symbols from a fixed, finite alphabet

115 ;;Quote: an automaton's operation is determined by finite, internal states; i.e., stable states of the machine at discrete time intervals; nothing else matters

115 ;;Quote: intermediate states matter only if they immediately preceed the reading of a symbol from a finite tape

118 ;;Quote: one-tape, finite automaton are closed under backward tapes and complex products; forms a Boolean algebra of sets

120 ;;Quote: nondeterministic automaton equivalent to finite automaton; many choices at each move, with at least one winning combination; simpler description with fewer internal states