In automata theory, a field of computer 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 all with the same speed. Along the transitions of the automaton, clock values can be compared to integers. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. Further, clocks can be reset. [1]
^Brihaye, Thomas; Geeraerts, Gilles; Ho, Hsi-Ming; Monmege, Benjamin (2017). "Timed-Automata-Based Verification of MITL over Signals". 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). 90: 7:1–7:19. doi:10.4230/LIPIcs.TIME.2017.7.
computer science, a signalautomaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a signalautomaton, clock values...
computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories...
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...
Nobili's cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells to cross signals and store information...
In automata theory, a hybrid automaton (plural: hybrid automata or hybrid automatons) is a mathematical model for precisely describing hybrid systems...
von Neumann's original cellular automaton, the crossing of signals is much more difficult. The most widely used signal crossing organs are the coded channel...
single time unit. Let us now consider a system, such as a timed automaton or a signalautomaton, which want to know at each instant whether S holds or not...
opposite player, the automaton would signal it by turning on a light. If the opposing player made three illegal moves, the automaton would stop playing...
A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced...
A learning automaton is one type of machine learning algorithm studied since 1970s. Learning automata select their current action based on past experiences...
a cellular automaton (CA) model for spiking neural networks (SNNs). CoDi is an acronym for Collect and Distribute, referring to the signals and spikes...
Neumann's universal constructor is a self-replicating machine in a cellular automaton (CA) environment. It was designed in the 1940s, without the use of a computer...
A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping...
Wireworld, alternatively WireWorld, is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently...
making it extremely practical to perform computing with them. A cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite or...
used to convey digital signals between the ALU and external circuitry. When an ALU is operating, external circuits apply signals to the ALU inputs and...
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...
only when the global clock signal changes. Typically the current state is stored in flip-flops, and a global clock signal is connected to the "clock"...
Statistical multiplexing Charlieplexing Priority encoder Rule 184, a cellular automaton in which each cell acts as a multiplexer for the values from the two adjacent...
circuit or signal Asynchronous communication, transmission of data without the use of an external clock signal Asynchronous cellular automaton, a mathematical...
Global Information