Morphisms, Symbolic sequences, and their Standard Forms

MaRDI QIDQ3465222zbMATH OpenFDO

Authors F. Michel Dekking

Publication date 21 January 2016

Full work available at URL https://arxiv.org/abs/1509.00260, http://www.emis.de/journals/JIS/VOL19/Dekking/dekk4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Fibonacci wordmorphismpure morphicstandard formsubstitution

Mathematics Subject Classification ID

Automata sequences (11B85) Symbolic dynamics (37B10) Combinatorics on words (68R15)

Abstract: 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 morphism. We propose a way to select a unique representing member out of all these morphisms. This has applications to the classification of the shift dynamical systems generated by morphisms. In a similar way, we propose the selection of a representing sequence out of the class of symbolic sequences over an alphabet of fixed cardinality. Both methods are useful for the storing of symbolic sequences in databases, like The On-Line Encyclopedia of Integer Sequences. We illustrate our proposals with the $k$-symbol Fibonacci sequences.

Recommendations

• The structure of morphisms
• Recognizability for sequences of morphisms
• scientific article; zbMATH DE number 839393
• Mapping Equivalence for Symbolic Sequences: Theory and Applications
• Morphisms and almost-periodicity
• Exact homomorphism sequences in homology theory
• scientific article; zbMATH DE number 4049852
• s-sequences and symmetric algebras
• Higher Auslander-Reiten sequences via morphisms determined by objects
• scientific article; zbMATH DE number 758009

Cited in

(9)

• Morphic words, Beatty sequences and integer images of the Fibonacci language
• Generalized Beatty sequences and complementary triples
• scientific article; zbMATH DE number 2124073 (Why is no real title available?)
• Topological conjugacy of constant length substitution dynamical systems
• Permutations of \(\mathbb{N}\) generated by left-right filling algorithms
• On the conjugacy class of the Fibonacci dynamical system
• Recognizability for sequences of morphisms
• GAPS IN THE THUE–MORSE WORD
• Difference between two floor functions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Morphisms, Symbolic sequences, and their Standard Forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465222)