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

Quotation Skeleton

The automata used throughout Chapter I were strictly … Requiring all machines to be of this form … In this section we introduce the notion of … be defined by an ordinary automaton. The main … cases and the ease in which specific machines … A nondeterministic automaton is not a probabilistic machine … We … agree to let a machine accept a tape … final state.   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: history of programming (91 items)
Topic: formal methods and languages (53 items)