500 search results - page 63 / 100 » Universality and Cellular Automata |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
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...
IJFCS
2008
13 years 10 months ago
2008
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
FCT
2009
Springer
14 years 4 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...