Topic: Turing machine
Topic: formal methods and languages
Topic: state machine
Topic: automation
Topic: state
Topic: history of programming
 
Reference
Rabin, M.O., Scott, D.,
"Finite automata and their decision problems",
IBM Journal, April 1959, pp. 114125.
Google
Quotations
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 nervenets
 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: onetape, 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

Related Topics
Topic: Turing machine (30 items)
Topic: formal methods and languages (53 items)
Topic: state machine (67 items)
Topic: automation (15 items)
Topic: state (35 items)
Topic: history of programming (91 items)
