Julien Cassaigne

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 15

Top Topics

Syntactic Categories

High Computational Complexity

Invariant Properties

Top Venues

J. Comb. Theory, Ser. A

Fundam. Informaticae

Publications

Julien Cassaigne, France Gheeraert, Antonio Restivo, Giuseppe Romana, Marinella Sciortino, Manon Stipulanti
New string attractor-based complexities for infinite words. J. Comb. Theory, Ser. A 208 (2024)
Julien Cassaigne, Idrissa Kaboré
On the Complexity of the Generalized Fibonacci Words. RAIRO Theor. Informatics Appl. 56 (2022)
Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
On abelian saturated infinite words. Theor. Comput. Sci. 792 (2019)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina
-abelian palindromes. Inf. Comput. 260 (2018)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65 (2017)
Julien Cassaigne, Sébastien Labbé, Julien Leroy
A Set of Sequences of Complexity 2n+1 2 n + 1. WORDS (2017)
Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés
A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84 (2017)
Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni
Cyclic complexity of words. J. Comb. Theory, Ser. A 145 (2017)
Jean-Paul Allouche, Julien Cassaigne, Jeffrey O. Shallit, Luca Q. Zamboni
A Taxonomy of Morphic Sequences. CoRR (2017)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. Fundam. Informaticae 154 (1-4) (2017)
Boris Adamczewski, Julien Cassaigne, Marion Le Gonidec
On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited. CoRR (2016)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. DLT (2016)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Cost and dimension of words of zero topological entropy. CoRR (2016)
Julien Cassaigne, Idrissa Kaboré
Abelian Complexity and Frequencies of Letters in Infinite Words. Int. J. Found. Comput. Sci. 27 (5) (2016)
Julien Cassaigne, Éric Duchêne, Michel Rigo
Nonhomogeneous Beatty Sequences Leading to Invariant Games. SIAM J. Discret. Math. 30 (3) (2016)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On Growth and Fluctuation of k-Abelian Complexity. CSR (2015)
Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni
Cyclic Complexity of Words. CoRR (2014)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Subword complexity and decomposition of the set of factors. CoRR (2014)
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61 (2) (2014)
Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. CoRR (2014)
Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni
Cyclic Complexity of Words. MFCS (1) (2014)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) (2014)
Julien Cassaigne, Éric Duchêne, Michel Rigo
Invariant games and non-homogeneous Beatty sequences. CoRR (2013)
Julien Cassaigne
Which Arnoux-Rauzy Words Are 2-Balanced? WORDS (2013)
Valérie Berthé, Julien Cassaigne, Wolfgang Steiner
Balance Properties of Arnoux-Rauzy Words. Int. J. Algebra Comput. 23 (4) (2013)
Valérie Berthé, Julien Cassaigne, Wolfgang Steiner
Balance properties of Arnoux-Rauzy words CoRR (2012)
Julien Cassaigne, François Nicolas
On the decidability of semigroup freeness. RAIRO Theor. Informatics Appl. 46 (3) (2012)
Julien Cassaigne, Sébastien Ferenczi, Luca Q. Zamboni
Combinatorial trees arising in the study of interval exchange transformations. Eur. J. Comb. 32 (8) (2011)
Nicolas Bedaride, Julien Cassaigne
Outer billiard outside regular polygons. J. Lond. Math. Soc. 84 (2) (2011)
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
Avoiding Three Consecutive Blocks of the Same Size and Same Sum CoRR (2011)
Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22 (4) (2011)
Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Avoiding Abelian powers in binary words with bounded Abelian complexity CoRR (2010)
Vincent D. Blondel, Julien Cassaigne, Raphaël M. Jungers
On the number of alpha-power-free binary words for 2alpha<=7/3. Theor. Comput. Sci. 410 (30-32) (2009)
Julien Cassaigne, Juhani Karhumäki, Petri Salmela
Conjugacy of finite biprefix codes. Theor. Comput. Sci. 410 (24-25) (2009)
Julien Cassaigne, Pedro V. Silva
Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions. Int. J. Algebra Comput. 19 (4) (2009)
Julien Cassaigne, François Nicolas
On the Morse-Hedlund complexity gap CoRR (2009)
Julien Cassaigne, François Nicolas
On polynomial growth functions of D0L-systems CoRR (2009)
Julien Cassaigne, Christian Mauduit, François Nicolas
Asymptotic behavior of growth functions of D0L-systems CoRR (2008)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Discret. Appl. Math. 156 (9) (2008)
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni
Relationally Periodic Sequences and Subword Complexity. Developments in Language Theory (2008)
Julien Cassaigne, François Nicolas
On the decidability of semigroup freeness CoRR (2008)
Julien Cassaigne
On extremal properties of the Fibonacci word. RAIRO Theor. Informatics Appl. 42 (4) (2008)
Julien Cassaigne, Anna E. Frid
On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380 (3) (2007)
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Electron. Notes Discret. Math. 21 (2005)
Jean-Paul Allouche, Michael Baake, Julien Cassaigne, David Damanik
Palindrome complexity. Theor. Comput. Sci. 292 (1) (2003)
Julien Cassaigne
Constructing Infinite Words of Intermediate Complexity. Developments in Language Theory (2002)
Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
On the presence of periodic configurations in Turing machines and in counter machines. Theor. Comput. Sci. 289 (1) (2002)
Julien Cassaigne, Juhani Karhumäki, Ján Manuch
On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Julien Cassaigne
Recurrence in Infinite Words. STACS (2001)
Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, Florent Hivert
The Chinese Monoid. Int. J. Algebra Comput. 11 (3) (2001)
Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. MCU (2001)
Julien Cassaigne, James D. Currie
Words Strongly Avoiding Fractional Powers. Eur. J. Comb. 20 (8) (1999)
Julien Cassaigne
Double Sequences with Complexity mn+1. J. Autom. Lang. Comb. 4 (3) (1999)
Julien Cassaigne
Limit Values of the Recurrence Quotient of Sturmian Sequences. Theor. Comput. Sci. 218 (1) (1999)
Julien Cassaigne
Subword complexity and periodicity in two or more dimensions. Developments in Language Theory (1999)
Julien Cassaigne, Tero Harju, Juhani Karhumäki
On the Undecidability of Freeness of Matrix Semigroups. Int. J. Algebra Comput. 9 (3-4) (1999)
Julien Cassaigne, Juhani Karhumäki
Examples of Undecidable Problems for 2-Generator Matrix Semigroups. Theor. Comput. Sci. 204 (1-2) (1998)
Julien Cassaigne
On a Conjecture of J. Shallit. ICALP (1997)
Julien Cassaigne
Sequences with grouped factors. Developments in Language Theory (1997)
Julien Cassaigne, Juhani Karhumäki
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. Eur. J. Comb. 18 (5) (1997)
Julien Cassaigne, Steven R. Finch
A Class of 1-Additive Sequences and Quadratic Recurrences. Exp. Math. 4 (1) (1995)
Julien Cassaigne
Special Factors of Sequences with Linear Subword Complexity. Developments in Language Theory (1995)
Julien Cassaigne, Juhani Karhumäki
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). COCOON (1995)
Julien Cassaigne
An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern. IFIP Congress (1) (1994)
Julien Cassaigne
Unavoidable Binary Patterns. Acta Informatica 30 (4) (1993)
Julien Cassaigne
Counting Overlap-Free Binary Words. STACS (1993)
Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold
About Gauss codes. Bull. EATCS 48 (1992)