Equality of morphic sequences
H Zantema - arXiv preprint arXiv:2407.15721, 2024 - arxiv.org
Morphic sequences form a natural class of infinite sequences, typically defined as the
coding of a fixed point of a morphism. Different morphisms and codings may yield the same …
coding of a fixed point of a morphism. Different morphisms and codings may yield the same …
A taxonomy of morphic sequences
JP Allouche, J Cassaigne, J Shallit… - arXiv preprint arXiv …, 2017 - arxiv.org
arXiv:1711.10807v1 [cs.FL] 29 Nov 2017 A Taxonomy of Morphic Sequences Page 1 arXiv:1711.10807v1
[cs.FL] 29 Nov 2017 A Taxonomy of Morphic Sequences Jean-Paul Allouche CNRS, IMJ-PRG …
[cs.FL] 29 Nov 2017 A Taxonomy of Morphic Sequences Jean-Paul Allouche CNRS, IMJ-PRG …
Morphisms, symbolic sequences, and their standard forms
FM Dekking - arXiv preprint arXiv:1509.00260, 2015 - arxiv.org
Morphisms are homomorphisms under the concatenation operation of the set of words over
a finite set. Changing the elements of the finite set does not essentially change the …
a finite set. Changing the elements of the finite set does not essentially change the …
Constructing Morphisms for Arithmetic Subsequences of Fibonacci
W Bosma, H Don - Logics and Type Systems in Theory and Practice …, 2024 - Springer
From a general theorem by Dekking it follows that an arithmetic subsequence of any
morphic sequence is morphic again. The construction of such a morphism is not directly …
morphic sequence is morphic again. The construction of such a morphism is not directly …
On uniformly recurrent morphic sequences
F Nicolas, Y Pritykin - … Journal of Foundations of Computer Science, 2009 - World Scientific
A pure morphic sequence is a right-infinite, symbolic sequence obtained by iterating a letter-
to-word substitution. For instance, the Fibonacci sequence and the Thue–Morse sequence …
to-word substitution. For instance, the Fibonacci sequence and the Thue–Morse sequence …
A counterexample to a question of Hof, Knill and Simon
S Labbé - arXiv preprint arXiv:1307.1589, 2013 - arxiv.org
In this article, we give a negative answer to a question of Hof, Knill and Simon (1995)
concerning purely morphic sequences obtained from primitive morphism containing an …
concerning purely morphic sequences obtained from primitive morphism containing an …
[HTML][HTML] Morphic words, Beatty sequences and integer images of the Fibonacci language
M Dekking - Theoretical Computer Science, 2020 - Elsevier
Morphic words are letter-to-letter images of fixed points x of morphisms on finite alphabets.
There are situations where these letter-to-letter maps do not occur naturally, but have to be …
There are situations where these letter-to-letter maps do not occur naturally, but have to be …
Sequences generated by infinitely iterated morphisms
P Séébold - Discrete applied mathematics, 1985 - Elsevier
We show that the Morse sequence is the only infinite binary sequence without overlapping
factor which can be generated by an iterated morphism. We also show that if an infinite …
factor which can be generated by an iterated morphism. We also show that if an infinite …
Morphic Sequences: Complexity and Decidability
R Henry - arXiv preprint arXiv:2406.16406, 2024 - arxiv.org
Morphic Sequences: Complexity and Decidability Page 1 S. Brlek and L. Ferrari (Eds.):
GASCom 2024 EPTCS 403, 2024, pp. 113–117, doi:10.4204/EPTCS.403.24 © R. Henry This …
GASCom 2024 EPTCS 403, 2024, pp. 113–117, doi:10.4204/EPTCS.403.24 © R. Henry This …
[HTML][HTML] Palindromic sequences generated from marked morphisms
S Labbé, E Pelantová - European Journal of Combinatorics, 2016 - Elsevier
Fixed points u= φ (u) of marked and primitive morphisms φ over arbitrary alphabet are
considered. We show that if u is palindromic, ie, its language contains infinitely many …
considered. We show that if u is palindromic, ie, its language contains infinitely many …