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 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.
initially this research was supported by Polish KBN grant No. 2 P301 034 07.
a part of this research has been done when this author was with Heinz Nixdorf Institute and Department of Mathematics & Computer Science, University of Paderborn
Preview
Unable to display preview. Download preview PDF.
References
A.O. Buda, Multiprocessor automata, IPL 25 (1987), 257–161.
P. ďuriš, Z. Galil, Sensing versus nonsensing automata, in Proc. ICALP'95, LNCS 944, Springer-Verlag 1995, pp. 455–463.
M. Holzer, Multi-head finite automata: data-independent versus data-dependent computations, in Proc. MFCS'97, LNCS 1295, Springer-Verlag 1995, pp. 299–308.
T. Jiang, M. Li, k one-way heads cannot do string-matching, in Proc. STOC '93, pp. 62–70.
M. Li, P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag 1993.
B. Monien, Two-way multihead automata over a one-letter alphabet, R.A.I.R.O. Informatique théorique 14 (1980), 67–82.
A.C. Yao, R.L. Rivest, k +1 heads are better than k, JACM 25 (1978), 337–340.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ď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. https://doi.org/10.1007/BFb0055111
Download citation
DOI: https://doi.org/10.1007/BFb0055111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive