Abstract
This paper studies how one can spread points in the Besicovitch space in order to keep them far one from another. We first study the general case and then what happens if the chosen points are all regular Toeplitz configurations or all quasiperiodic configurations.
This work has been supported by the ANR Blanc “Projet EQINOCS” (ANR-11-BS02-004).
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
Allouche, J.-P., Shallit, J.O.: Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press (2003)
Blanchard, F., Cervelle, J., Formenti, E.: Some results about the chaotic behavior of cellular automata. Theor. Comput. Sci. 349(3), 318–336 (2005)
Blanchard, F., Formenti, E., Kůrka, P.: Cellular automata in the Cantor, Besicovitch and Weyl Topological Spaces. Complex Systems 11, 107–123 (1999)
Cattaneo, G., et al.: A Shift-invariant Metric on S ℤ Inducing a Non-trivial Topology. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 179–188. Springer, Heidelberg (1997)
Durand, B.: Tilings and Quasiperiodicity. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 65–75. Springer, Heidelberg (1997)
Formenti, E.: On the sensitivity of cellular automata in Besic ovitch spaces. Theoretical Computer Science 301(1-3), 341–354 (2003)
Hedlund, G.A.: Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory 3, 320–375 (1969)
Semakov, N.V., Zinov’ev, V.A.: Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs. Problemy Peredachi Informatsii 4(2), 3–10 (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cervelle, J. (2012). Covering Space in the Besicovitch Topology. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)