171 search results - page 3 / 35 » On the Power of Tree-Walking Automata |
100
click to vote
CMSB
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
ICALP
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
54
Voted
LATA
2010
Springer
15 years 7 months ago
2010
Springer
100
Voted
ATVA
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...