This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
7.-References
Amoroso, S., Patt, Y.N., Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, J. Comput. System Sci., 6, 1972, 448–464.
Béal, M.P., Codes circulaires, automates locaux et entropie, Rapport L.I.T.P, 86-55, 1986.
Berstel, J., Perrin D., Theory of Codes, Academic Press, 1985.
Hedlund, G.A., Endomorphisms and automorphisms of the shift dynamical system, Math. Syst. Theory, 3, 1969, 320–375.
Nasu, M., Indecomposable local maps of tesselation automata, Math. Systems Theory, 13, 1979, 81–93.
Wagoner, J.B., Realizing symmetries of a subshift of finite type by homeomorphisms of spheres, Bull. Amer. Math. Soc., 14, 1986, 301–304.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrin, D. (1988). Local maps. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-19444-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19444-6
Online ISBN: 978-3-540-39270-5
eBook Packages: Springer Book Archive