Pseudopalindrome closure operators in free monoids
From MaRDI portal
Publication:2508984
DOI10.1016/j.tcs.2006.07.009zbMath1101.68073OpenAlexW2055362193MaRDI QIDQ2508984
Aldo De Luca, Alessandro De Luca
Publication date: 20 October 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.009
Related Items (47)
On a special class of primitive words ⋮ A relation by palindromic subwords ⋮ Counting (Watson-Crick) palindromes in Watson-Crick conjugates ⋮ Palindromic richness for languages invariant under more symmetries ⋮ Enumeration of two dimensional palindromes ⋮ Normalization of ternary generalized pseudostandard words ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ Reprint of: ``Palindromization and construction of Markoff triples ⋮ HV-Palindromes in Two-Dimensional Words ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ String Attractors for Factors of the Thue-Morse Word ⋮ Morphisms generating antipalindromic words ⋮ On periodicity of generalized pseudostandard words ⋮ Sturmian and Episturmian Words ⋮ On a Generalization of Standard Episturmian Morphisms ⋮ Palindromic closures using multiple antimorphisms ⋮ On some problems related to palindrome closure ⋮ The pseudopalindromic completion of regular languages ⋮ Some properties of involution binary relations ⋮ ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS ⋮ Disjunctivity and other properties of sets of pseudo-bordered words ⋮ On different generalizations of episturmian words ⋮ Involutions of epicentral words ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ On the fixed points of the iterated pseudopalindromic closure operator ⋮ Characteristic morphisms of generalized episturmian words ⋮ Fine and Wilf words for any periods. II ⋮ A generalized palindromization map in free monoids ⋮ An extension of the Lyndon-Schützenberger result to pseudoperiodic words ⋮ On a Special Class of Primitive Words ⋮ A palindromization map on free monoids ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ Watson-Crick palindromes in DNA computing ⋮ Watson-Crick Conjugate and Commutative Words ⋮ A new estimate on complexity of binary generalized pseudostandard words ⋮ Fixed points of morphisms among binary generalized pseudostandard words ⋮ On \(\theta\)-episturmian words ⋮ Palindromization and construction of Markoff triples ⋮ On a Family of Morphic Images of Arnoux-Rauzy Words ⋮ PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS ⋮ Twin-roots of words and their properties ⋮ Rich and Periodic-Like Words ⋮ An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD ⋮ On graphs of central episturmian words ⋮ Sturmian words and the Stern sequence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On some combinatorial problems in free monoids
- On the combinatorics of finite words
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Episturmian words and episturmian morphisms
- Some characterizations of finite Sturmian words.
- On a paper by Castelli, Mignosi, Restivo
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On some problems related to palindrome closure
- A remark on morphic sturmian words
- Episturmian morphisms and a Galois theorem on continued fractions
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Pseudopalindrome closure operators in free monoids
