Issue Theoret. Informatics Appl. Volume 39, Number 2, April-June 2005 Page(s) 403 - 419 DOI 10.1051/ita:2005025

Theoret. Informatics Appl. 39, 403-419 (2005)
DOI: 10.1051/ita:2005025

Efficient simulation of synchronous systems by multi-speed systems

Tomasz Jurdzinski^{1, 2}, Miroslaw Kutylowski³ and Jan Zatopianski<sup>3

1</sup>  Institute of Computer Science, Wroclaw University, Przesmyckiego 20, PL-51-151 Wroclaw, Poland.
²  Institute of Mathematics and Computer Science, Kassel University, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany.
³  Institute of Mathematics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, PL-50-370 Wroclaw, Poland.

(Received November, 2002. Accepted September, 2004.)

Abstract
We consider systems consisting of finite automata communicating by exchanging messages and working on the same read-only data. We investigate the situation in which the automata work with constant but different speeds. We assume furthermore that the automata are not aware of the speeds and they cannot measure them directly. Nevertheless, the automata have to compute a correct output. We call this model multi-speed systems of finite automata. Complexity measure that we consider here is the number of messages sent by the automata. The main result of this paper is that multi-speed systems are as powerful as synchronous systems, in which all automata work with the same speed.

Mathematics Subject Classification. 03D15, 68Q45

Key words: Multi-head automata -- systems of finite automata -- communication complexity -- message complexity


© EDP Sciences 2005

What is OpenURL?