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...
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...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...
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 ...
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...