Reversals and palindromes in continued fractions

Authors:
Boris Adamczewski;Jean-Paul Allouche
Affiliations:
CNRS, Université Claude Bernard Lyon 1, Institut Camille Jordan, Bât. Braconnier, 21 avenue Claude Bernard, F-69622 Villeurbanne Cedex, France;CNRS, LRI, Université Paris-Sud, Bât. 490, F-91405 Orsay Cedex, France
Venue:
Theoretical Computer Science
Year:
2007

Citing 14
Cited 4

Infinite words with linear subword complexity

Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Sturmian words, Lyndon words and trees

Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
Limit values of the recurrence quotient of Sturmian sequences

Theoretical Computer Science
Sturmian words and words with a critical exponent

Theoretical Computer Science
Special factors, periodicity, and an application to Sturmian words

Acta Informatica
On the Index of Sturmian Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On a Conjecture of J. Shallit

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Formal Power Series and Their Continued Fraction Expansion

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Powers in Sturmian sequences

European Journal of Combinatorics
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
Some properties of the factors of Sturmian sequences

Theoretical Computer Science
Harmonic and gold Sturmian words

European Journal of Combinatorics
Palindromic prefixes and episturmian words

Journal of Combinatorial Theory Series A

Periodicity, repetitions, and orbits of an automatic sequence

Theoretical Computer Science
Relation between powers of factors and the recurrence function characterizing Sturmian words

Theoretical Computer Science
Hartmanis-Stearns conjecture on real time and transcendence

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
On the least number of palindromes contained in an infinite word

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Several results on continued fractions expansions are on indirect consequences of the mirror formula. We survey occurrences of this formula for Sturmian real numbers, for (simultaneous) Diophantine approximation and for formal power series.