String attractors of Rote sequences

DOI10.46298/DMTCS.12385MaRDI QIDQ6986999zbMATH OpenFDO

Authors L'ubomíra Dvořáková, Veronika Hendrychová

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.12385

zbMATH Keywords

antipalindromic closuregeneralized pseudostandard sequencespalindromic closurepseudostandard sequencesRote sequencesstring attractors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• A combinatorial view on string attractors
• At the roots of dictionary compression: string attractors
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• On generalized pseudostandard words over binary alphabets
• On periodicity of generalized pseudostandard words
• Palindromic closures using multiple antimorphisms
• Pseudopalindrome closure operators in free monoids
• Sequences with subword complexity \(2n\)
• Some combinatorial properties of Sturmian words
• String Attractors for Factors of the Thue-Morse Word
• String attractors of episturmian sequences
• String Attractors of Fixed Points of k-Bonacci-Like Morphisms
• Towards a definitive measure of repetitiveness

This page was built for publication: String attractors of Rote sequences

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