Descendants of primitive substitutions
From MaRDI portal
Publication:1281932
DOI10.1007/s002240000114zbMath0916.68086OpenAlexW2072968076MaRDI QIDQ1281932
Luca Q. Zamboni, Charles Holton
Publication date: 22 March 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000114
Related Items (19)
Occurrences of palindromes in characteristic Sturmian words ⋮ Generalized balances in Sturmian words ⋮ Powers in a class of \(\mathcal A\)-strict standard episturmian words ⋮ A connection between palindromic and factor complexity using return words ⋮ Quasiperiodic and Lyndon episturmian words ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ Episturmian words: a survey ⋮ On Sturmian substitutions closed under derivation ⋮ Suffix conjugates for a class of morphic subshifts ⋮ Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems ⋮ Bifix codes and Sturmian words ⋮ Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories ⋮ Extremal words in morphic subshifts ⋮ The sum of digits functions of the Zeckendorf and the base phi expansions ⋮ Relations on words ⋮ Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts ⋮ Permutations of N generated by left-right filling algorithms ⋮ Palindromic richness ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
This page was built for publication: Descendants of primitive substitutions
