Sciweavers

223 search results - page 30 / 45
» Synchronization of Pushdown Automata
Sort
View
JAC
2008
13 years 9 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
EMSOFT
2006
Springer
13 years 11 months ago
Polychronous mode automata
Among related synchronous programming principles, the model of computation of the Polychrony workbench stands out by its capability to give high-level description of systems where...
Jean-Pierre Talpin, Christian Brunette, Thierry Ga...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
ACRI
2006
Springer
14 years 1 months ago
Parallel Simulation of Asynchronous Cellular Automata Evolution
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...
Olga L. Bandman
STACS
2010
Springer
14 years 2 months ago
Ultimate Traces of Cellular Automata
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
Julien Cervelle, Enrico Formenti, Pierre Guillon