摘要: Publisher Summary The chapter presents a survey, which focuses that part of automaton theory lies outside certain sub-theories—namely, switching theory, the computability, artificial intelligence, and learning machines as well several topics related to statistical aspects machines. These sub-theories are briefly described with some references show how they fit into whole. An is device finite size at any time parts specified inputs outputs, such what happens outputs determined, or least its probability distribution function by has happened inputs. discusses five types automaton—fixed growing; discrete continuous; synchronous non-synchronous; deterministic probabilistic; finite-state infinite-state. Given state value for each input automaton, moment time, output next determined. behavior characterized completely description these transitions from values, presented table graph.