13 search results - page 1 / 3 » Traced communication complexity of cellular automata |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
ICGI
2010
Springer
13 years 6 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
TCS
2011
12 years 12 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...