A connection between palindromic and factor complexity using return words

@article{Bucci2008ACB,
  title={A connection between palindromic and factor complexity using return words},
  author={Michelangelo Bucci and Alessandro De Luca and Amy Glen and Luca Q. Zamboni},
  journal={Adv. Appl. Math.},
  year={2008},
  volume={42},
  pages={60-74}
}
View PDF on arXiv
50 Citations
Highly Influential Citations
6
Background Citations
24
Methods Citations
2
Results Citations
2

50 Citations

Languages invariant under more symmetries: Overlapping factors versus palindromic richness

Upper bound for palindromic and factor complexity of rich words

This paper proves the inequality for every finite word v with |v| ≥ n + 1 and v(n + 1) closed under reversal, where w is an infinite word whose set of factors is open under reversal.

Palindromic richness for languages invariant under more symmetries

On theta-palindromic richness

On generalized highly potential words

Palindromic complexity of codings of rotations

Return words in codings of rotations

We study the structure of infinite words obtained by coding rotations on partitions of the unit circle by inspecting the return words. The main result is that every factor of a coding of rotations on…

On morphisms preserving palindromic richness

This paper looks for homomorphisms of the free monoid, which allow to construct new rich words from already known rich words, and studies two types of morphisms: Arnoux-Rauzy morphisms and morphisms from Class $P_{ret}$.

PROOF OF BRLEK-REUTENAUER CONJECTURE

Brlek and Reutenauer conjectured that any in nite word u with language closed under reversal satis es the equality 2D(u) = ∑+∞ n=0 Tu(n) in which D(u) denotes the defect of u and Tu(n) denotes Cu(n +…

Infinite words with finite defect

References

SHOWING 1-10 OF 29 REFERENCES

On The Palindromic Complexity Of Infinite Words

It is proved that there exist periodic words having the maximum number of palindromes as in the case of Sturmian words, by providing a simple and easy to check condition.

Palindrome complexity

Factor versus palindromic complexity of uniformly recurrent infinite words

On some problems related to palindrome closure

It is proved that for any given pseudostandard word s with seed, all sufficiently long left special factors of s are prefixes of it, and it is also shown that if ϑ is an involutory antimorphism of A*, then the right and left ϑ -palindromic closures of any factor of a ϒ -standard word are also factors of some ϑ-standard word.

Palindromic prefixes and episturmian words

Palindromes and Sturmian Words

On the Number of Factors of Sturmian Words

Palindromic Prefixes and Diophantine Approximation

Abstract.This article is devoted to simultaneous approximation to ξ and ξ2 by rational numbers with the same denominator, where ξ is an irrational non-quadratic real number. We focus on an exponent…

Episturmian words and some constructions of de Luca and Rauzy

PALINDROMES AND PSEUDO-PALINDROMES IN EPISTURMIAN AND PSEUDO-PALINDROMIC INFINITE WORDS

Let A be a finite set of cardinality greater or equal to 2. An infinite word ω ∈ AN is called Episturmian if it is closed under mirror image (meaning if u = u1u2 · · ·uk is a subword of ω, then so is…