Abstract
It is well-known that for classical one-dimensional one-way CA (OCA) it is possible to speed up language recognition times from (1 + r)n, r ∈ R + , to (1 + r/2)n. In this paper we show that this no longer holds for OCA in which a cell can comminucate only one bit (or more generally a fixed amount) of information to its neighbor in each step. For arbitrary real numbers r 2 > r 1 > 1 in time r 2 n 1-bit OCA can recognize strictly more languages than those operating in time r 1 n. Thus recognition times may increase by an arbitrarily large constant factor when restricting the communication to 1 bit. For two-way CA there is also an infinite hierarchy but it is not known whether it is as dense as for OCA. Furthermore it is shown that for communication restricted CA two-way flow of information can be much more powerful than an arbitrary number of additional communication bits.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers C-18(4), 349–365 (1969)
Mazoyer, J.: A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged. Technical Report TR 89-03, Ecole Normale Supérieure de Lyon, Lyon (1989)
Smith III, A.R.: Cellular automata complexity trade-offs. Information and Control 18, 466–482 (1971)
Umeo, H.: Cellular algorithms with 1-bit inter-cell communications. In: Worsch, T., Vollmar, R. (eds.) MFCS 1998 Satellite Workshop on Cellular Automata, pp. 93–104 (1998)
Vollmar, R., Worsch, T.: Modelle der Parallelverarbeitung – eine Einführung. Teubner, Stuttgart (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Worsch, T. (2000). Linear Time Language Recognition on Cellular Automata with Restricted Communication. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_41
Download citation
DOI: https://doi.org/10.1007/10719839_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive