Sciweavers

426 search results - page 2 / 86
» Synchronization of Regular Automata
Sort
View
ICALP
2010
Springer
14 years 13 days ago
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Stochastic Minority on Graphs
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
Jean-Baptiste Rouquier, Damien Regnault, Eric Thie...
MEMOCODE
2005
IEEE
14 years 1 months ago
PyPBS design and methodologies
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...
Greg Hoover, Forrest Brewer
AUTOMATICA
2008
198views more  AUTOMATICA 2008»
13 years 6 months ago
Asynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
Hamid Beigy, Mohammad Reza Meybodi
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