A continuous automaton can be described as a cellular automaton extended so that the valid states a cell can take are not just discrete (for example,...

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...

of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees...

A continuous spatial automaton is a type of computer model studied in automata theory, a subfield of computer science. It is similar to a cellular automaton...

with analog physical processes. A hybrid automaton is a finite-state machine with a finite set of continuous variables whose values are described by a...

A cellular automaton (CA) is Life-like (in the sense of being similar to Conway's Game of Life) if it meets the following criteria: The array of cells...

Life, also known as Conway's Game of Life or simply Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is...

The movable cellular automaton (MCA) method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of...

such an automaton correspond to the states of a "discrete-state discrete-parameter Markov process". At each time step t = 0,1,2,3,..., the automaton reads...

In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise...

deformation of and transmission of forces through materials modeled as a continuous medium (also called a continuum) rather than as discrete particles. Continuum...

the non-negative integers we call the system a semi-cascade. A cellular automaton is a tuple (T, M, Φ), with T a lattice such as the integers or a higher-dimensional...

intended to be a continuous generalization of Conway's Game of Life, with continuous states, space and time. As a consequence of its continuous, high-resolution...

relating to Conway's Game of Life. For instance, the Life-like cellular automaton B1/S12 when applied to a single cell will generate four approximations...

most types of an asynchronous concurrent system. On its own, the I/O automaton model contains a very basic structure that enables it to model various...

robot band designed by al-Jazari. A table device automaton designed by al-Jazari. The hand-washing automaton with a flush mechanism designed by al-Jazari...

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...

steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). Markov processes are named...

cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers....

Guo-Zheng; Giles, C. Lee; Chen, Hsing-Hen (1998). "The Neural Network Pushdown Automaton: Architecture, Dynamics and Training". In Giles, C. Lee; Gori, Marco (eds...

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells...

cellular automaton created in 1984 by Christopher Langton. They consist of a loop of cells containing genetic information, which flows continuously around...

the transition function of a one-dimensional cellular automaton if and only if it is continuous (with respect to the Cantor topology) and equivariant...

science, a signal automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a signal automaton, clock values increase...

)} indicating the probability of the automaton being in an accept state; that is, indicating whether the automaton accepted or rejected the string. The...

(described by a differential equation) and jump (described by a state machine, automaton, or a difference equation). Often, the term "hybrid dynamical system"...

The Greenberg–Hastings Cellular Automaton (abbrev. GH model) is a three state two dimensional cellular automaton (abbrev CA) named after James M. Greenberg...

the input length. The numbers of live cells in space-filling cellular automaton patterns such as the breeder, as a function of the number of time steps...

To be the transition function of a cellular automaton, a function from states to states must be a continuous function for this topology, and must also be...

sort of cellular automaton or other discrete computing machinery, challenging the long-held view that some physical laws are continuous by nature. He focused...