「Automata」の共起表現(1語右で並び替え)

意味
共起
表現

「Automata」の共起表現一覧(1語右で並び替え)

Automata

1語右で並び替え

該当件数:130件

Multiple grottoes with water-driven automata, a water organ, surprise jets that drenched v
In Conway's Game of Life and other cellular automata, a still life is a pattern that does not chan
In cellular automata, a methuselah is a small "seed" pattern of in
he theory, implementation, and application of automata and related structures.
patterns also appear in the study of cellular automata and other parallel computing models.
tally spatial simulation methods are cellular automata and agent-based modeling.
are important in the use of formal languages, automata and semiautomata.
His contributions include timed automata and temporal specifications based on language
n the theories of regular expressions, finite automata, and of directed graphs.
aspects of implementation and application of automata and related structures, including theoretical
eaking contributions to the areas of cellular automata and Wang tiles.
Many other cellular automata and other computational systems are capable o
plex Systems, genetic algorithms and cellular automata, and her publications in those fields are fre
w and manually manipulate the shapes of small automata and transducers.
He has worked on cellular automata and the theory of artificial life (with Edwar
ter scientist, known for his work on cellular automata and reversible computing.
ch as LTL-formulae (Linear temporal logic) or automata and statecharts.
hich combined fireworks, perpetual fountains, automata and ingenious mechanisms of all kinds, includ
In particular, for two-state cellular automata, any ordinary CA rule can be turned into a se
Various other cellular automata are known to support replicators, patterns th
Such automata are called ω-automata.
, i.e. pebble automata are strictly weaker than branching automata
Such procedure for some type of automata are very useful for their software implementa
Automata are used to structure communicating programs
Vereofy uses constraint automata as formal semantics for the components behavi
Technically, they are not cellular automata at all, because the underlying “space” is the
r Vitruvius' design, clockwork-driven musical automata birds who sang as nightingales and cuckoos, m
s a model stronger than ordinary tree walking automata, but still strictly weaker than branching aut
They have a finite state control like other automata, but their internal storage may vary widely f
eek into Latin: one source says it was Hero's Automata; but more likely it was the Mechanica.
One-dimensional cyclic cellular automata can be interpreted as systems of interacting
Such automata can be used to model certain physical reactio
Hybrid automata come in several flavors: The Alur-Henzinger h
tically split into two tracks on "Algorithms, Automata, Complexity and Games" (Track A) and Logic, "
Elaine Rich, Automata, computability and complexity: theory and app
An automata construction is called optimal if there is an
he notation describing the family of cellular automata containing Life, it is described by the rule
ritime artists, children's book illustrators, automata, contemporary painters and printmakers.
ncluding aerodynamics; architecture; cellular automata; data; engineering; entomology; model theory;
ns and performing standard algorithms such as automata determinization, minimization, and intersecti
His research interests include cellular automata, discrete mathematics as pertains to computat
hur W. (1956), The logic of fixed and growing automata, Engineering Research Institute, University o
eal-time systems modeled as networks of timed automata, extended with data types (bounded integers,
The modeling language are timed automata extended with concepts for modular modeling.
h, B. Hasslacher, and Y. Pomeau, "Lattice gas Automata for the Navier Stokes Equation"' Phys.
ncluding reaction-diffusion systems, cellular automata, fractals, Ising model, Griffiths phases, sel
workshops DCAGRS (Descriptional Complexity of Automata, Grammars and Related Structures) and FDSR (F
Models of quantum cellular automata have been proposed by David Meyer, by Bruce B
s a mathematical characterization of cellular automata in terms of their symbolic dynamics.
, Wolfram believes that rule 30, and cellular automata in general, are the key to understanding how
mann, who used it for his pioneering cellular automata including the Universal Constructor.
Focusing motor automata is absent (manual only).
study of the mathematical properties of such automata is automata theory
nference on Implementation and Application of Automata is an annual academic conference in the field
red important for a model of quantum cellular automata is that it should be universal for quantum co
a basic question about deterministic pushdown automata: it is decidable whether a given deterministi
undations of Computer Science, the Journal of Automata, Languages and Combinatorics, and of Theoreti
Special Issue: Journal of Automata, Languages and Combinatorics, announced (as o
ter science on regular expressions and finite automata led to the discovery that context-free gramma
s include computer viruses, Core Wars, finite automata like Conway's Game of Life, brown noise, the
ational model is a generalisation of cellular automata, Lindenmayer systems, Paun systems and other
described in his book with Toffoli, Cellular Automata Machines (MIT Press, 1987), and with Tom Knig
golus and is described at length in "Cellular Automata Machines", by Toffoli and Margolus (MIT Press
Cellular Automata Machines: A New Environment for Modeling, MIT
Lazy linear hybrid automata model the discrete time behavior of control s
Cellular automata modeling imposes a fixed spatial framework su
poster featuring selections from the original Automata print campaigns and was issued in a one time
Santa Fe Institute, in the Evolving Cellular Automata Project and the Computation, Dynamics and Inf
finite state automata, pushdown automata, etc.).
ges: Reo Coordination Language and Constraint Automata Reactive Module Language.
Continuous spatial automata resemble continuous automata in having contin
are also possible for the elementary cellular automata Rule 45 and Rule 126, for certain string rewr
patterns showing properties of other Cellular Automata rules.
erts was "There's no blood in our games, it's Automata sauce".
urther conditions, e.g. that quantum cellular automata should be reversible and/or local unitary, an
dyear MPP and later MasPar MP-1) for cellular automata simulations of evolutionary systems.
class is referred to as generalized cellular automata since the classical or standard cellular auto
In most cases, for defining instances of automata, such as deterministic finite automata (DFAs)
orks, computer games, etc., in which cellular automata such as Conway's Game of Life feature promine
In cellular automata such as Conway's Game of Life, a reflector is
ey can be integrated into a common geographic automata system where some agents are fixed while othe
In cellular automata, the Moore neighborhood comprises the eight c
In cellular automata, the von Neumann neighborhood comprises the f
In automata theory and sequential logic, a state transiti
Teaching of automata theory
features extended coverage of examples where automata theory is applied, whereas large parts of mor
Many hard problems in automata theory involve finding the right construction
For example, in automata theory and formal language theory it is conve
Deterministic automaton is a concept of automata theory in which the outcome of a transition f
computer science, particularly infinite-state automata theory and temporal logic.
year, A. A. Karatsuba, "On a problem from the automata theory" which was distinguished by testimonia
oth in his 1967 book "Sequential Machines and Automata Theory".
cience, the Krohn-Rhodes theory (or algebraic automata theory) is an approach to the study of finite
The first edition of Introduction to Automata Theory, Languages, and Computation was publis
rest in many fields of mathematics, including automata theory, combinatorics, discrete geometry, dyn
Introduction to Automata Theory, Languages, and Computation (2nd ed.).
Introduction to Automata Theory, Languages, and Computation (1st ed.).
In automata theory, a hybrid automaton (plural: hybrid au
In automata theory, automata construction is an important
In theoretical computer science and automata theory, determinizing a non-deterministic aut
In computer science and automata theory, a state is a unique configuration of
In automata theory, an alternating finite automaton (AFA)
These included automata theory, the structured programming theory of
In automata theory, an alternating tree automaton is an e
In automata theory, a nondeterministic finite automaton w
In automata theory, a nested stack automaton is a finite
after Edward F. Moore, a pioneer of cellular automata theory.
ment Analysis can be thought of as continuous automata, though this degree of abstraction away from
visiting the edge of chaos: Evolving cellular automata to perform computations.
eleased "Pimania: The Music of Mel Croucher & Automata U.K., Ltd.", a deluxe vinyl LP album of the m
text-and-graphics adventure game released by Automata UK in 1982 for the BBC Micro, ZX Spectrum, Dr
me of this additional star could be mailed to Automata UK for entry in to a prize draw to take place
is a computer game developed and published by Automata UK for the ZX Spectrum in 1983.
Continuous spatial automata, unlike cellular automata, have a continuum o
erification of scheduling based on task timed automata using the Uppaal model checker and the Verima
from similar constructions for other types of automata, was first published by M. O. Rabin and Dana
One of al-Jazari's humanoid automata was a waitress that could serve water, tea or
One of these almost intelligent automata was attributed to Albertus Magnus, and it is
n 1206 by al-Jazari, who employed them in his automata, water clocks (such as the candle clock) and
ted to von Neumann's work on self reproducing automata, where he holds a self description necessary
ced by Stephen Kleene to characterise certain automata, where it means "zero or more".
the Margolus neighborhood for block cellular automata, which he used to develop cellular automaton
ble automaton is an extension of tree walking automata which allows the automaton to use a finite am
Markov chain resembles that of a measure-many automata, with some important substitutions: the initi
Stephen M. Omohundro, "Modelling Cellular Automata with Partial Differential Equations", Physica
tation can be readily generalised to cellular automata with dimensionality other than two.
cycle rank among all nondeterministic finite automata with ε-moves accepting L.
ster's degree and a PhD thesis on "Stochastic automata with structural restrictions", under the supe