Special factors of automatic sequences (Q1917395): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Représentation géométrique de suites de complexité $2n+1$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of factors in the Thue-Morse word / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Suites algébriques, automates et substitutions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniform tag sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3228119 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3338346 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata calculating the complexity of automatic sequences / rank | |||
Normal rank |
Latest revision as of 13:10, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Special factors of automatic sequences |
scientific article |
Statements
Special factors of automatic sequences (English)
0 references
2 March 1997
0 references
The author defines a special factor \(v\) of an infinite sequence \(u\) on a finite alphabet \(A\) to be a finite factor (subblock) of \(u\) such that, for each letter \(a\in A\), the word \(va\) is also a factor of \(u\). Such words are sometimes called extendable, but note that a more general definition only assumes that \(va\) is a factor for at least one letter \(a\) [see for example: \textit{J. Cassaigne}, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc. (to appear)]. In order to study the special factors of infinite fixed points of morphisms, the author introduces the notion of rythmical word (essentially a word that is the ``unique'' image of another word by the morphism). Note that a recent paper by \textit{B. Mossé} [Reconnaissabilité des substitutions et complexité des suites automatiques, Bull. Soc. Math. Fr. 124, 329-346 (1996; Zbl 0855.68072)] gives complementary results.
0 references
complexity of a sequence
0 references
extendable words
0 references
special factors of infinite fixed points of morphisms
0 references
rythmical word
0 references