ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS

JOURNAL ARTICLE published April 2004 in International Journal of Foundations of Computer Science

Authors: S. BRLEK | S. HAMEL | M. NIVAT | C. REUTENAUER

Complexity and palindromic defect of infinite words

JOURNAL ARTICLE published February 2011 in Theoretical Computer Science

Authors: S. Brlek | C. Reutenauer

Preface

JOURNAL ARTICLE published August 2018 in International Journal of Foundations of Computer Science

Authors: Alexandre Blondin Massé | Srečko Brlek | Christophe Reutenauer

Combinatorics on Words

BOOK published 2017 in Lecture Notes in Computer Science

Editors: Srečko Brlek | Francesco Dolce | Christophe Reutenauer | Élise Vandomme

Combinatorial properties of smooth infinite words

JOURNAL ARTICLE published March 2006 in Theoretical Computer Science

Authors: S. Brlek | S. Dulucq | A. Ladouceur | L. Vuillon

SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS

JOURNAL ARTICLE published April 2004 in International Journal of Foundations of Computer Science

Authors: JEFFREY SHALLIT

Reconstructing Words from a σ-palindromic Language

JOURNAL ARTICLE published 2014 in Fundamenta Informaticae

Authors: Srečko Brlek | Nadia Lafreniére

WORD COMPLEXITY AND REPETITIONS IN WORDS

JOURNAL ARTICLE published February 2004 in International Journal of Foundations of Computer Science

Authors: LUCIAN ILIE | SHENG YU | KAIZHONG ZHANG

The Maximal Complexity of Quasiperiodic Infinite Words

JOURNAL ARTICLE published 17 November 2021 in Axioms

Authors: Ludwig Staiger

Palindromic factors of billiard words

JOURNAL ARTICLE published June 2005 in Theoretical Computer Science

Authors: J.-P. Borel | C. Reutenauer

Factor versus palindromic complexity of uniformly recurrent infinite words

JOURNAL ARTICLE published June 2007 in Theoretical Computer Science

Research funded by Ministerstvo Školství, Mládeže a Tělovýchovy (LC00602) | Grantová Agentura České Republiky (GACˇ R 201/05/0169)

Authors: Peter Baláži | Zuzana Masáková | Edita Pelantová

Abelian Complexity and Frequencies of Letters in Infinite Words

JOURNAL ARTICLE published August 2016 in International Journal of Foundations of Computer Science

Authors: Julien Cassaigne | Idrissa Kaboré

Music and combinatorics on words: a historical survey

JOURNAL ARTICLE published 2 September 2018 in Journal of Mathematics and Music

Authors: Srečko Brlek | Marc Chemillier | Christophe Reutenauer

Varieties

BOOK CHAPTER published 2004 in Infinite Words - Automata, Semigroups, Logic and Games

Palindromic complexity of infinite words associated with non-simple Parry numbers

JOURNAL ARTICLE published January 2009 in RAIRO - Theoretical Informatics and Applications

Authors: L'ubomíra Balková | Zuzana Masáková

Palindromic complexity of infinite words associated with simple Parry numbers

JOURNAL ARTICLE published 2006 in Annales de l’institut Fourier

Authors: Petr Ambrož | Zuzana Masáková | Edita Pelantová | Christiane Frougny

Palindromic complexity of codings of rotations

JOURNAL ARTICLE published October 2011 in Theoretical Computer Science

Authors: A. Blondin Massé | S. Brlek | S. Labbé | L. Vuillon

ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES

JOURNAL ARTICLE published December 2004 in International Journal of Foundations of Computer Science

Authors: OLIVIER FINKEL

Complexity in Dynamics and Computation

BOOK CHAPTER published 2001 in Recent Developments in Infinite-Dimensional Analysis and Quantum Probability

Authors: Masanori Ohya

For the 50th anniversary of Eric Goles: A few words by Maurice Nivat

JOURNAL ARTICLE published August 2004 in Theoretical Computer Science

Authors: M Nivat