About Gauss codes. - Julien Cassaigne; Sylviane R. Schwer; Patrice Séébold (Bull. EATCS, 1992)

Counting Overlap-Free Binary Words. - Julien Cassaigne (STACS, 1993)

Unavoidable Binary Patterns. - Julien Cassaigne (Acta Informatica, 1993)

An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern. - Julien Cassaigne (IFIP Congress (1), 1994)

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). - Julien Cassaigne; Juhani Karhumäki (COCOON, 1995)

Special Factors of Sequences with Linear Subword Complexity. - Julien Cassaigne (Developments in Language Theory, 1995)

A Class of 1-Additive Sequences and Quadratic Recurrences. - Julien Cassaigne; Steven R. Finch (Exp. Math., 1995)

Sequences with grouped factors. - Julien Cassaigne (Developments in Language Theory, 1997)

On a Conjecture of J. Shallit. - Julien Cassaigne (ICALP, 1997)

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. - Julien Cassaigne; Juhani Karhumäki (Eur. J. Comb., 1997)

Examples of Undecidable Problems for 2-Generator Matrix Semigroups. - Julien Cassaigne; Juhani Karhumäki (Theor. Comput. Sci., 1998)

Subword complexity and periodicity in two or more dimensions. - Julien Cassaigne (Developments in Language Theory, 1999)

Words Strongly Avoiding Fractional Powers. - Julien Cassaigne; James D. Currie (Eur. J. Comb., 1999)

On the Undecidability of Freeness of Matrix Semigroups. - Julien Cassaigne; Tero Harju; Juhani Karhumäki (Int. J. Algebra Comput., 1999)

Double Sequences with Complexity mn+1. - Julien Cassaigne (J. Autom. Lang. Comb., 1999)

Limit Values of the Recurrence Quotient of Sturmian Sequences. - Julien Cassaigne (Theor. Comput. Sci., 1999)

On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. - Vincent D. Blondel; Julien Cassaigne; Codrin M. Nichitiu (MCU, 2001)

Recurrence in Infinite Words. - Julien Cassaigne (STACS, 2001)

The Chinese Monoid. - Julien Cassaigne; Marc Espie; Daniel Krob; Jean-Christophe Novelli; Florent Hivert (Int. J. Algebra Comput., 2001)

On Conjugacy of Languages. - Julien Cassaigne; Juhani Karhumäki; Ján Manuch (RAIRO Theor. Informatics Appl., 2001)

Constructing Infinite Words of Intermediate Complexity. - Julien Cassaigne (Developments in Language Theory, 2002)

On the presence of periodic configurations in Turing machines and in counter machines. - Vincent D. Blondel; Julien Cassaigne; Codrin M. Nichitiu (Theor. Comput. Sci., 2002)

Palindrome complexity. - Jean-Paul Allouche; Michael Baake; Julien Cassaigne; David Damanik (Theor. Comput. Sci., 2003)

Sequences of low arithmetical complexity. - Sergey V. Avgustinovich; Julien Cassaigne; Anna E. Frid (RAIRO Theor. Informatics Appl., 2006)

On the arithmetical complexity of Sturmian words. - Julien Cassaigne; Anna E. Frid (Theor. Comput. Sci., 2007)

Relationally Periodic Sequences and Subword Complexity. - Julien Cassaigne; Tomi Kärki; Luca Q. Zamboni (Developments in Language Theory, 2008)

Asymptotic behavior of growth functions of D0L-systems - Julien Cassaigne; Christian Mauduit; François Nicolas (CoRR, 2008)

On the correlation of binary sequences. - Rudolf Ahlswede; Julien Cassaigne; András Sárközy (Discret. Appl. Math., 2008)

On extremal properties of the Fibonacci word. - Julien Cassaigne (RAIRO Theor. Informatics Appl., 2008)

On the Morse-Hedlund complexity gap - Julien Cassaigne; François Nicolas (CoRR, 2009)

On polynomial growth functions of D0L-systems - Julien Cassaigne; François Nicolas (CoRR, 2009)

Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions. - Julien Cassaigne; Pedro V. Silva (Int. J. Algebra Comput., 2009)

On the number of alpha-power-free binary words for 2alpha<=7/3. - Vincent D. Blondel; Julien Cassaigne; Raphaël M. Jungers (Theor. Comput. Sci., 2009)

Conjugacy of finite biprefix codes. - Julien Cassaigne; Juhani Karhumäki; Petri Salmela (Theor. Comput. Sci., 2009)

Combinatorial trees arising in the study of interval exchange transformations. - Julien Cassaigne; Sébastien Ferenczi; Luca Q. Zamboni (Eur. J. Comb., 2011)

Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. - Julien Cassaigne; Gwénaël Richomme; Kalle Saari; Luca Q. Zamboni (Int. J. Found. Comput. Sci., 2011)

Outer billiard outside regular polygons. - Nicolas Bedaride; Julien Cassaigne (J. Lond. Math. Soc., 2011)

On the decidability of semigroup freeness. - Julien Cassaigne; François Nicolas (RAIRO Theor. Informatics Appl., 2012)

Which Arnoux-Rauzy Words Are 2-Balanced? - Julien Cassaigne (WORDS, 2013)

Invariant games and non-homogeneous Beatty sequences. - Julien Cassaigne; Éric Duchêne; Michel Rigo (CoRR, 2013)

Balance Properties of Arnoux-Rauzy Words. - Valérie Berthé; Julien Cassaigne; Wolfgang Steiner (Int. J. Algebra Comput., 2013)

Subword Complexity and Decomposition of the Set of Factors. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (MFCS (1), 2014)

Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. - Julien Cassaigne; Vesa Halava; Tero Harju; François Nicolas (CoRR, 2014)

Avoiding Three Consecutive Blocks of the Same Size and Same Sum. - Julien Cassaigne; James D. Currie; Luke Schaeffer; Jeffrey O. Shallit (J. ACM, 2014)

On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited. - Boris Adamczewski; Julien Cassaigne; Marion Le Gonidec (CoRR, 2016)

Cost and dimension of words of zero topological entropy. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (CoRR, 2016)

Abelian Complexity and Frequencies of Letters in Infinite Words. - Julien Cassaigne; Idrissa Kaboré (Int. J. Found. Comput. Sci., 2016)

Nonhomogeneous Beatty Sequences Leading to Invariant Games. - Julien Cassaigne; Éric Duchêne; Michel Rigo (SIAM J. Discret. Math., 2016)

A Set of Sequences of Complexity 2n+1 2 n + 1. - Julien Cassaigne; Sébastien Labbé 001; Julien Leroy 002 (WORDS, 2017)

A Taxonomy of Morphic Sequences. - Jean-Paul Allouche; Julien Cassaigne; Jeffrey O. Shallit; Luca Q. Zamboni (CoRR, 2017)

On growth and fluctuation of k-abelian complexity. - Julien Cassaigne; Juhani Karhumäki; Aleksi Saarela (Eur. J. Comb., 2017)

k-Abelian Equivalence and Rationality. - Julien Cassaigne; Juhani Karhumäki; Svetlana Puzynina; Markus A. Whiteland (Fundam. Informaticae, 2017)

A small minimal aperiodic reversible Turing machine. - Julien Cassaigne; Nicolas Ollinger; Rodrigo Torres-Avilés (J. Comput. Syst. Sci., 2017)

Cyclic complexity of words. - Julien Cassaigne; Gabriele Fici; Marinella Sciortino; Luca Q. Zamboni (J. Comb. Theory A, 2017)

On k-abelian palindromes. - Julien Cassaigne; Juhani Karhumäki; Svetlana Puzynina (Inf. Comput., 2018)

On abelian saturated infinite words. - Sergey V. Avgustinovich; Julien Cassaigne; Juhani Karhumäki; Svetlana Puzynina; Aleksi Saarela (Theor. Comput. Sci., 2019)

On the Complexity of the Generalized Fibonacci Words. - Julien Cassaigne; Idrissa Kaboré (RAIRO Theor. Informatics Appl., 2022)

New string attractor-based complexities for infinite words. - Julien Cassaigne; France Gheeraert; Antonio Restivo; Giuseppe Romana; Marinella Sciortino; Manon Stipulanti (J. Comb. Theory, Ser. A, 2024)