PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Communication complexity for multi-speed cooperating automata

Identyfikatory
Warianty tytułu
Konferencja
I konferencja dla Młodych Matematyków Zastosowanie Matematyki - Karpacz 2000
Języki publikacji
EN
Abstrakty
EN
We consider bounded memory asynchronous systems. They consist of finite automata working independently and communicating by exchanging messages. We discuss what impact the differences in timing models on computational power of such systems have. It is known that a total lack of synchronization has profound consequences for computational power of systems of automata. Lower bounds found for this model indicate that the only way to perform a nontrivial computation would be to re-synchronize the automata every 0(1) steps. We examine much weaker form of asynchronism. We consider the model in which automata work with constant speeds, but the speed might be different for each automaton, and the automata have no knowledge about the speeds. (We call this model multi-speed systems of finite automata.) In particular, it may happen that some speed cannot be expressed exactly by the means of internal states of automata. Nevertheless, we expect the automata to compute the correct output. The main result of this paper is that, quite unexpectedly, the systems described might be as powerful as synchronous systems, where all automata work with the same speed. More precisely, some languages, which have been candidates for distinguishing multi-speed and synchronous models, can be recognized by multi-speed systems with approximately the same number of messages sent.
Twórcy
autor
  • Department of Computer Science, technical University of Chemists, Germany.
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPW5-0006-0053
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.