A new estimate on complexity of binary generalized pseudostandard words

zbMath1420.68162arXiv1611.05482MaRDI QIDQ5384198

L'ubomíra Dvořáková, Josef Florian

Publication date: 21 June 2019

Full work available at URL: https://arxiv.org/abs/1611.05482

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (2)

Normalization of ternary generalized pseudostandard words ⋮ Fixed points of morphisms among binary generalized pseudostandard words

Uses Software

• SageMath

Cites Work

• Unnamed Item
• On the fixed points of the iterated pseudopalindromic closure operator
• On periodicity of generalized pseudostandard words
• Complexity and special factors
• Sturmian words: structure, combinatorics, and their arithmetics
• Palindromic closures using multiple antimorphisms
• Pseudopalindrome closure operators in free monoids
• On some problems related to palindrome closure
• Symbolic Dynamics
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: A new estimate on complexity of binary generalized pseudostandard words