On generalized pseudostandard words over binary alphabets

MaRDI QIDQ5404291zbMATH OpenFDO

Authors Alexandre Blondin Massé, Geneviève Paquin, Hugo Tremblay, L. Vuillon

Publication date 24 March 2014

Full work available at URL http://www.emis.de/journals/JIS/VOL16/Blondin/blondin.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

normalizationpalindromepseudopalindromeFine and Wilf theoremgeneralized pseudostandard worddirective bi-sequenceiterated pseudopalindromic closureJustin's formula

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symbolic dynamics (37B10) Combinatorics on words (68R15)

Recommendations

• On periodicity of generalized pseudostandard words
• Normalization of ternary generalized pseudostandard words
• Pseudopalindrome closure operators in free monoids
• Palindromic closures using multiple antimorphisms
• A new estimate on complexity of binary generalized pseudostandard words

Cited in

(8)

• Normalization of ternary generalized pseudostandard words
• On periodicity of generalized pseudostandard words
• Derived sequences of complementary symmetric Rote sequences
• A new estimate on complexity of binary generalized pseudostandard words
• Fixed points of morphisms among binary generalized pseudostandard words
• String Attractors for Factors of the Thue-Morse Word
• Morphisms generating antipalindromic words
• Palindromic closures using multiple antimorphisms

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: On generalized pseudostandard words over binary alphabets

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