Power of cooperation and multihead finite systems
- Cite this paper as:
- ďuriš P., Jurdziński T., Kutyłowski M., LoryŚ K. (1998) Power of cooperation and multihead finite systems. In: Larsen K.G., Skyum S., Winskel G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg
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 heads, but the automata cooperate in making state transitions. Computational power of such devices depends on the number of states of automata, the number of automata, and the way they cooperate. We concentrate our attention on the last issue. The first situation that we consider is that each automaton has a full knowledge on the states of all automata (multihead automata). The other extreme is that each automaton (called also a processor) has no knowledge of the states of other automata; merely, there is a central processing unit that may “freeze” any automaton or let it proceed its work (so called multiprocessor automata). The second model seems to be severely restricted, but we show that multihead and multiprocessor automata have similar computational power. Nevertheless, we show a separation result.
Unable to display preview. Download preview PDF.