Fixed points of morphisms among binary generalized pseudostandard words

MaRDI QIDQ5384229zbMATH OpenFDO

Authors Tereza Velká, L'ubomíra Dvořáková

Publication date 21 June 2019

Full work available at URL https://arxiv.org/abs/1701.04472, http://math.colgate.edu/~integers/s21/s21.pdf

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words that are not standard Sturmian words.

Recommendations

• scientific article; zbMATH DE number 17555
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• scientific article; zbMATH DE number 2051165
• On a conjecture about finite fixed points of morphisms
• On periodicity of generalized pseudostandard words

Cites work

• A new estimate on complexity of binary generalized pseudostandard words
• Episturmian words and some constructions of de Luca and Rauzy
• On generalized pseudostandard words over binary alphabets
• On periodicity of generalized pseudostandard words
• Palindromic closures using multiple antimorphisms
• Pseudopalindrome closure operators in free monoids

Cited in

(6)

• Morphisms generating antipalindromic words
• Normalization of ternary generalized pseudostandard words
• scientific article; zbMATH DE number 17555 (Why is no real title available?)
• A new estimate on complexity of binary generalized pseudostandard words
• On a conjecture about finite fixed points of morphisms
• On periodicity of generalized pseudostandard words

This page was built for publication: Fixed points of morphisms among binary generalized pseudostandard words

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