Patrice Séébold

39 papers A* 1B 4C 1Misc 1Journal 26Unranked 5
YearRankTypeTitle / Venue / Authors
2021 — conf
A Characterization of Binary Morphisms Generating Lyndon Infinite Words.
WORDS
Gwénaël Richomme, Patrice Séébold
2021 J jnl
A characterization of binary morphisms generating Lyndon infinite words.
CoRR
Gwénaël Richomme, Patrice Séébold
2018 J jnl
Avoidability of circular formulas.
Theor. Comput. Sci.
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2018 J jnl
Sturmian images of non Sturmian words and standard morphisms.
Theor. Comput. Sci.
Patrice Séébold
2016 J jnl
Avoidability of circular formulas.
CoRR
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2012 J jnl
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms.
Theor. Comput. Sci.
Gwénaël Richomme, Patrice Séébold
2012 J jnl
Length-k-overlap-free Binary Infinite Words.
Fundam. Informaticae
Patrice Séébold
2011 J jnl
On factorially balanced sets of words.
Theor. Comput. Sci.
Gwénaël Richomme, Patrice Séébold
2009 J jnl
Overlap-freeness in infinite partial words.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold
2008 C conf
Counting Ordered Patterns in Words Generated by Morphisms.
LATA
Sergey Kitaev, Toufik Mansour, Patrice Séébold
2008 J jnl
Look and Say Fibonacci.
RAIRO Theor. Informatics Appl.
Patrice Séébold
2007 J jnl
Tag-systems for the Hilbert Curve.
Discret. Math. Theor. Comput. Sci.
Patrice Séébold
2004 J jnl
Conjectures And Results On Morphisms Generating K-Power-Free Words.
Int. J. Found. Comput. Sci.
Gwénaël Richomme, Patrice Séébold
2004 J jnl
Generating the Peano Curve and Counting Occurrences of some Patterns.
J. Autom. Lang. Comb.
Sergey Kitaev, Toufik Mansour, Patrice Séébold
2003 J jnl
Foreword.
Theor. Comput. Sci.
Patrice Séébold
2003 J jnl
Lyndon factorization of the Prouhet words.
Theor. Comput. Sci.
Patrice Séébold
2003 J jnl
On some generalizations of the Thue-Morse morphism.
Theor. Comput. Sci.
Patrice Séébold
2002 J jnl
About some Overlap-Free Morphisms on a n-Letter Alphabet.
J. Autom. Lang. Comb.
Patrice Séébold
2001 — conf
Some Properties of the Prouhet Morphism and Words.
DCFS
Patrice Séébold
1999 J jnl
Characterization of Test-sets for Overlap-free Morphisms.
Discret. Appl. Math.
Gwénaël Richomme, Patrice Séébold
1998 J jnl
On the Conjugation of Standard Morphisms.
Theor. Comput. Sci.
Patrice Séébold
1997 Misc conf
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
COCOON
Yuji Kobayashi, Friedrich Otto, Patrice Séébold
1996 B conf
On the Conjugation of Standard Morphisms.
MFCS
Patrice Séébold
1994 J jnl
A Remark on Morphic Sturmian Words.
RAIRO Theor. Informatics Appl.
Jean Berstel, Patrice Séébold
1994 — ch.
Redundant Retreat Free Words.
Mathematical Aspects of Natural and Formal Languages
Patrice Séébold, Karine Slowinski
1993 J jnl
A Characterization of Overlap-Free Morphisms.
Discret. Appl. Math.
Jean Berstel, Patrice Séébold
1993 B conf
A Characterization of Sturmian Morphisms.
MFCS
Jean Berstel, Patrice Séébold
1993 A* conf
If a D0L Language is k-Power Free then it is Circular.
ICALP
Filippo Mignosi, Patrice Séébold
1992 J jnl
About Gauss codes.
Bull. EATCS
Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold
1991 J jnl
Fibonacci Morphisms and Sturmian Words.
Theor. Comput. Sci.
Patrice Séébold
1991 J jnl
The Shortest Way to Draw a Connected Picture.
Comput. Graph. Forum
Patrice Séébold, Karine Slowinski
1990 — conf
Minimizing Picture Words.
IMYCS
Patrice Séébold, Karine Slowinski
1989 B conf
About a Family of Binary Morphisms which Stationary Words are Sturmian.
FCT
Patrice Séébold
1988 J jnl
An effect solution to the DOL periodicity problem in the binary case.
Bull. EATCS
Patrice Séébold
1986 J jnl
Complément A L'étude des Suites de Thue-Morse Généralisées.
RAIRO Theor. Informatics Appl.
Patrice Séébold
1985 B conf
Generalized Thue-Morse sequences.
FCT
Patrice Séébold
1985 J jnl
Sequences generated by infinitely iterated morphisms.
Discret. Appl. Math.
Patrice Séébold
1984 — conf
Overlap-free sequences.
Automata on Infinite Words
Patrice Séébold
1983 — conf
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
Theoretical Computer Science
Patrice Séébold