Normalization of ternary generalized pseudostandard words

DOI10.1016/j.tcs.2019.02.010zbMath1437.68145arXiv1807.07248OpenAlexW2963084598WikidataQ128319676 ScholiaQ128319676MaRDI QIDQ2420613

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

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

palindromepseudopalindromepalindromic closurepseudostandard wordstandard Sturmian wordgeneralized pseudostandard wordstandard episturmian word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

tgpc

Uses Software

• Python

Cites Work

• Unnamed Item
• On the fixed points of the iterated pseudopalindromic closure operator
• On periodicity of generalized pseudostandard words
• 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
• A new estimate on complexity of binary generalized pseudostandard words
• Fixed points of morphisms among binary generalized pseudostandard words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Normalization of ternary generalized pseudostandard words