ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
From MaRDI portal
Publication:3021999
DOI10.1142/S012905410400242XzbMath1067.68113OpenAlexW1980577621WikidataQ60704266 ScholiaQ60704266MaRDI QIDQ3021999
No author found.
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905410400242x
Related Items (59)
Palindromic language of thin discrete planes ⋮ Reciprocal Sum of Palindromes ⋮ Some permutations on Dyck words ⋮ Palindromic complexity of infinite words associated with simple Parry numbers ⋮ Palindromic Complexity of Trees ⋮ A connection between palindromic and factor complexity using return words ⋮ On Morphisms Preserving Palindromic Richness ⋮ Cyclic Complexity of Words ⋮ Episturmian words: a survey ⋮ On the least number of palindromes contained in an infinite word ⋮ Languages invariant under more symmetries: overlapping factors versus palindromic richness ⋮ Palindrome pattern matching ⋮ Palindromic richness for languages invariant under more symmetries ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Palindromes in circular words ⋮ Extensions of rich words ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ A counterexample to a question of Hof, Knill and Simon ⋮ Complexity and palindromic defect of infinite words ⋮ Balancedness and coboundaries in symbolic systems ⋮ Counting distinct palindromes in a word in linear time ⋮ Finite and infinite closed-rich words ⋮ Morphisms generating antipalindromic words ⋮ On theta-palindromic richness ⋮ Perfect balance and circularly rich words ⋮ On highly potential words ⋮ On generalized highly potential words ⋮ Palindromic complexity of codings of rotations ⋮ Palindromic closures using multiple antimorphisms ⋮ Ostrowski-automatic sequences: theory and applications ⋮ On generating binary words palindromically ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Generalized trapezoidal words ⋮ Counting Palindromes in Substrings ⋮ Greedy Palindromic Lengths ⋮ ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS ⋮ Palindromic sequences generated from marked morphisms ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Palindrome Pattern Matching ⋮ On the zero defect conjecture ⋮ On \(k\)-abelian palindromes ⋮ Longest arithmetic progressions of palindromes ⋮ Generalized Thue-Morse words and palindromic richness ⋮ On Brlek-Reutenauer conjecture ⋮ Infinite words with finite defect ⋮ Pseudopalindrome closure operators in free monoids ⋮ The repetition threshold for binary rich words ⋮ Palindromic richness ⋮ Palindromic rich words and run-length encodings ⋮ On Sturmian and episturmian words, and related topics ⋮ Total palindrome complexity of finite words ⋮ Codings of rotations on two intervals are full ⋮ Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties ⋮ Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study ⋮ A \(d\)-dimensional extension of Christoffel words ⋮ On a question of Hof, Knill and Simon on palindromic substitutive systems ⋮ On closed-rich words ⋮ Rich square-free words
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial addition formulas and applications
- Sturmian words: structure, combinatorics, and their arithmetics
- A note on differentiable palindromes.
- Palindrome complexity.
- Palindromes and Sturmian words
- Symbolic Dynamics
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
