Treffer: Fréquence des motifs dans les suites doubles invariantes par une substitution. (Frequency of patterns in double sequences invariant under a substitution)

Title:
Fréquence des motifs dans les suites doubles invariantes par une substitution. (Frequency of patterns in double sequences invariant under a substitution)
Authors:
Peyrière, Jacques
Publisher Information:
Université du Québec à Montréal, Département de Mathématiques, Montréal, Association Mathématique du Québec, Montréal
Subject Terms:
2-D substitution, Probabilistic theory: distribution modulo \(1\), metric theory of algorithms, double sequence, uniform tag-system, 2-D finite automaton, Sequences and sets, Formal languages and automata, Frequency of patterns, infinite sequence
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Access URL:
https://zbmath.org/4043955
Accession Number:
edsair.c2b0b933574d..28fb48ad1b672a4a25a197035f794cd0
Database:
OpenAIRE

Weitere Informationen

Let (a(n)) be an infinite sequence on a finite alphabet. If (a(n)) is generated by an automaton (i.e. uniform tag-system), or more generally by a substitution, one can study the frequency of occurrences of a letter or a pattern in the infinite word \(a(0)a(1)a(2)....\) The author already gave a generalization of the results in case of a self-similar graph [Frequency of patterns in certain graphs and in Penrose tilings, J. Phys., Colloque C3, 47, Suppl. au No.7 (1986)], but the formalism introduced is not that easy to deal with. Hence he gives in the paper under review a (much) simpler study in case of a double sequence (a(m,n)) generated by a 2-D finite automaton or a 2-D substitution.