Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. - Patrice Séébold (Theoretical Computer Science, 1983)

Overlap-free sequences. - Patrice Séébold (Automata on Infinite Words, 1984)

Generalized Thue-Morse sequences. - Patrice Séébold (FCT, 1985)

Sequences generated by infinitely iterated morphisms. - Patrice Séébold (Discret. Appl. Math., 1985)

Complément A L'étude des Suites de Thue-Morse Généralisées. - Patrice Séébold (RAIRO Theor. Informatics Appl., 1986)

An effect solution to the DOL periodicity problem in the binary case. - Patrice Séébold (Bull. EATCS, 1988)

About a Family of Binary Morphisms which Stationary Words are Sturmian. - Patrice Séébold (FCT, 1989)

Minimizing Picture Words. - Patrice Séébold; Karine Slowinski (IMYCS, 1990)

The Shortest Way to Draw a Connected Picture. - Patrice Séébold; Karine Slowinski (Comput. Graph. Forum, 1991)

Fibonacci Morphisms and Sturmian Words. - Patrice Séébold (Theor. Comput. Sci., 1991)

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

If a D0L Language is k-Power Free then it is Circular. - Filippo Mignosi; Patrice Séébold (ICALP, 1993)

A Characterization of Sturmian Morphisms. - Jean Berstel; Patrice Séébold (MFCS, 1993)

A Characterization of Overlap-Free Morphisms. - Jean Berstel; Patrice Séébold (Discret. Appl. Math., 1993)

Redundant Retreat Free Words. - Patrice Séébold; Karine Slowinski (Mathematical Aspects of Natural and Formal Languages, 1994)

A Remark on Morphic Sturmian Words. - Jean Berstel; Patrice Séébold (RAIRO Theor. Informatics Appl., 1994)

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. - Yuji Kobayashi; Friedrich Otto; Patrice Séébold (COCOON, 1997)

On the Conjugation of Standard Morphisms. - Patrice Séébold (Theor. Comput. Sci., 1998)

Characterization of Test-sets for Overlap-free Morphisms. - Gwénaël Richomme; Patrice Séébold (Discret. Appl. Math., 1999)

Some Properties of the Prouhet Morphism and Words. - Patrice Séébold (DCFS, 2001)

About some Overlap-Free Morphisms on a n-Letter Alphabet. - Patrice Séébold (J. Autom. Lang. Comb., 2002)

Foreword. - Patrice Séébold (Theor. Comput. Sci., 2003)

On some generalizations of the Thue-Morse morphism. - Patrice Séébold (Theor. Comput. Sci., 2003)

Lyndon factorization of the Prouhet words. - Patrice Séébold (Theor. Comput. Sci., 2003)

Conjectures And Results On Morphisms Generating K-Power-Free Words. - Gwénaël Richomme; Patrice Séébold (Int. J. Found. Comput. Sci., 2004)

Generating the Peano Curve and Counting Occurrences of some Patterns. - Sergey Kitaev; Toufik Mansour; Patrice Séébold (J. Autom. Lang. Comb., 2004)

Tag-systems for the Hilbert Curve. - Patrice Séébold (Discret. Math. Theor. Comput. Sci., 2007)

Counting Ordered Patterns in Words Generated by Morphisms. - Sergey Kitaev; Toufik Mansour; Patrice Séébold (LATA, 2008)

Look and Say Fibonacci. - Patrice Séébold (RAIRO Theor. Informatics Appl., 2008)

Overlap-freeness in infinite partial words. - Vesa Halava; Tero Harju; Tomi Kärki; Patrice Séébold (Theor. Comput. Sci., 2009)

On factorially balanced sets of words. - Gwénaël Richomme; Patrice Séébold (Theor. Comput. Sci., 2011)

Length-k-overlap-free Binary Infinite Words. - Patrice Séébold (Fundam. Informaticae, 2012)

Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. - Gwénaël Richomme; Patrice Séébold (Theor. Comput. Sci., 2012)

Avoidability of circular formulas. - Guilhem Gamard; Pascal Ochem; Gwénaël Richomme; Patrice Séébold (Theor. Comput. Sci., 2018)

Sturmian images of non Sturmian words and standard morphisms. - Patrice Séébold (Theor. Comput. Sci., 2018)

A Characterization of Binary Morphisms Generating Lyndon Infinite Words. - Gwénaël Richomme; Patrice Séébold (WORDS, 2021)