On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances
Initially proposed by Formenti et al. for bi-infinite sequences, the Besicovitch and Weyl pseudo-distances express the viewpoint of an observer moving infinitely far from the grid, rather than staying close as in the product topology. We extend their definition to a more general setting, which includes the usual infinite hypercubic grids, and highlight some noteworthy properties. We use them to measure the “frequency” of occurrences of patterns in configurations, and consider the behavior of sliding block codes when configurations at pseudo-distance zero are identified. One of our aims is to get an alternative characterization of surjectivity for sliding block codes.
Mathematics Subject Classification 2000: 37B15, 68Q80.
KeywordsPattern pseudo-distance sliding block code
Unable to display preview. Download preview PDF.
- 1.Blanchard, F., Formenti, E., Kůrka, P.: Cellular Automata in Cantor, Besicovitch, and Weyl Topological Spaces. Complex Systems 11(2), 107–123 (1999)Google Scholar
- 4.Capobianco, S.: Some Notes on Besicovitch and Weyl Distances over Higher-Dimensional Configurations. In: de Oliveira, P.P.B., Kari, J. (eds.) Proceedings of Automata 2009: 15th International Workshop on Cellular Automata and Discrete Complex Systems, Universidade Presbiteriana Mackenzie, São Paulo, SP, Brazil, Section 2: Short Papers, pp. 300–308 (2009)Google Scholar
- 6.de la Harpe, P.: Topics in Geometric Group Theory. The University of Chicago Press (2000)Google Scholar