On Substitutions Preserving Their Return Sets

DOI10.1007/978-3-031-33180-0_6MaRDI QIDQ6134863zbMATH OpenFDO

Authors Valérie Berthé, Herman Goulet-Ouellet

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33180-0_6

zbMATH Keywords

return wordssubstitutionsSturmian substitutions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 1333603 (Why is no real title available?)
• scientific article; zbMATH DE number 590283 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• A characterization of Sturmian words by return words
• A characterization of substitutive sequences using return words
• A generalization of Cobham's theorem
• A geometric interpretation of the Schützenberger group of a minimal subshift
• A remark on morphic sturmian words
• Acyclic, connected and tree sets
• Bifix codes and Sturmian words
• Bispecial factors in circular non-pushy D0L languages
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
• Codes and automata.
• Combinatorial group theory.
• Dimension groups and dynamical systems. Substitutions, Bratteli diagrams and Cantor systems
• Maximal bifix decoding
• On bispecial factors of the Thue-Morse word
• On the conjugation of standard morphisms
• Power of words and recognizability of fixpoints of a substitution
• Presentations of Schützenberger groups of minimal subshifts.
• Profinite groups associated with weakly primitive substitutions.
• Pronilpotent quotients associated with primitive substitutions
• Rigidity and substitutive dendric words
• Sequences with constant number of return words
• Stallings foldings and subgroups of free groups
• Sturmian morphisms and Rauzy's rules
• Substitution dynamical systems. Spectral analysis
• Substitutional dynamical systems, Bratteli diagrams and dimension groups
• Suffix-connected languages
• The constant of recognizability is computable for primitive morphisms

Cited in

(3)

• The asymptotic repetition threshold of sequences rich in palindromes
• Obstructions to return preservation for episturmian morphisms
• Stability properties for subgroups generated by return words

This page was built for publication: On Substitutions Preserving Their Return Sets

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