higher automaton
1Automaton — This article is about a self operating machine. For other uses of Automaton, see Automaton (disambiguation) or Automata (disambiguation). An automaton (plural: automata or automatons ) is a self operating machine. The word is sometimes used to… …
2Cyclic cellular automaton — A one dimensional cyclic cellular automaton with n = 4, run for 300 steps from a random initial configuration. The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton …
3Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states …
4Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] …
5Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… …
6Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… …
7Robot — This article is about mechanical robots. For other uses of the term, see robot (disambiguation). For software agents, see Bot. ASIMO (2000) at the Expo 2005, a humanoid robot …
8Pascal's triangle — The first six rows of Pascal s triangle In mathematics, Pascal s triangle is a triangular array of the binomial coefficients in a triangle. It is named after the French mathematician, Blaise Pascal. It is known as Pascal s triangle in much of the …
9History of artificial intelligence — The history of artificial intelligence begins in antiquity with myths, stories and rumors of artificial beings endowed with intelligence and consciousness by master craftsmen. In the middle of the 20th century, a handful of scientists began to… …
10Curtis–Hedlund–Lyndon theorem — The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton L. Curtis, Gustav A. Hedlund, and Roger Lyndon; in his 1969 paper stating the theorem, Hedlund …
