Model checking Finite automata Probabilistic automaton Colored Petri net "Linear Temporal Logic of Constraint Automata" by Sara Navidpour and Mohammad Izadi...

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

instance, the regular constraint expresses that a sequence of variables is accepted by a deterministic finite automaton. Global constraints are used to simplify...

transition rules that obey physical constraints such as reversibility and conservation laws. A block cellular automaton consists of the following components:...

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...

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...

1994, enables the modeling of systems where timing constraints are crucial. In a timed automaton, all clock values increase uniformly with passing time...

connected nodes. Later, an automaton-based semantics was developed, which is called constraint automata. A constraint automaton is a labeled transition system...

∈ Z {\displaystyle P\in \mathbb {Z} } . This is the state set of the automaton and characterizes the possible states that may be found at each site....

generates, the type of automaton that recognizes it, and the form its rules must have. The classes are defined by the constraints on the productions rules...

alternating timed automaton (ATA) is a modeling formalism that combines features of timed automaton and an alternating finite automaton to succinctly express...

automata (LGCA), or lattice gas cellular automata, are a type of cellular automaton used to simulate fluid flows, pioneered by Hardy–Pomeau–de Pazzis and...

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...

this is necessary due to parity constraints. Initially, much of the cell-space, the universe of the cellular automaton, is "blank", consisting of cells...

translated to or interpreted as a finite-state automaton or a state transition system. This automaton represents the possible configurations of the system...

delete. Which method is used may be determined by a referential integrity constraint defined in a data dictionary. The adjective 'referential' describes the...

{R} _{\geq 0}^{2}} . Allowing diagonal constraints may allow to decrease the size of a formula or of an automaton used to describe a system. However, algorithm's...

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...

propositional temporal logic-formula, or timed automaton or signal automaton using only the constraints of K {\displaystyle K} can not distinguish both...

or exactly equal to 1 for embarrassingly parallel problems. Cellular automaton Connection Machine CUDA framework Manycore processor Map (parallel pattern)...

maximally dense still life has attracted attention as a test case for constraint programming. In the limit of an infinitely large grid, no more than half...

amenable than the currently popular modeling paradigm of linear hybrid automaton.[citation needed] [1] Formalization and theory behind the model Reachability...

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

new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that the...

theoretically as powerful as any computer with unlimited memory and no time constraints: it is Turing complete. It was conjectured that any still life could...

capacity constraint Cartesian tree cascade merge sort caverphone Cayley–Purser algorithm C curve cell probe model cell tree cellular automaton centroid...

classified by the class of formal languages they are able to recognize. An automaton can be a finite representation of a formal language that may be an infinite...

1206, Al-Jazari invented programmable automata/robots. He described four automaton musicians, including drummers operated by a programmable drum machine...

automata Emptiness problem for a nondeterministic two-way finite state automaton Equivalence problem for nondeterministic finite automata Word problem...

expression; those strings accepted by some automaton, such as a Turing machine or finite-state automaton; those strings for which some decision procedure...