| 2009 |
|---|
| 26 | EE | Vesa Halava,
Tero Harju,
Tomi Kärki,
Patrice Séébold:
Overlap-freeness in infinite partial words.
Theor. Comput. Sci. 410(8-10): 943-948 (2009) |
| 2008 |
|---|
| 25 | EE | Sergey Kitaev,
Toufik Mansour,
Patrice Séébold:
Counting Ordered Patterns in Words Generated by Morphisms.
LATA 2008: 287-298 |
| 2004 |
|---|
| 24 | EE | Gwénaël Richomme,
Patrice Séébold:
Conjectures And Results On Morphisms Generating K-Power-Free Words.
Int. J. Found. Comput. Sci. 15(2): 307-316 (2004) |
| 23 | | Sergey Kitaev,
Toufik Mansour,
Patrice Séébold:
Generating the Peano Curve and Counting Occurrences of some Patterns.
Journal of Automata, Languages and Combinatorics 9(4): 439-455 (2004) |
| 2003 |
|---|
| 22 | | Patrice Séébold:
Foreword.
Theor. Comput. Sci. 292(1): 1 (2003) |
| 21 | | Patrice Séébold:
On some generalizations of the Thue-Morse morphism.
Theor. Comput. Sci. 292(1): 283-298 (2003) |
| 20 | EE | Patrice Séébold:
Lyndon factorization of the Prouhet words.
Theor. Comput. Sci. 307(1): 179-197 (2003) |
| 2002 |
|---|
| 19 | | Patrice Séébold:
About some Overlap-Free Morphisms on a n-Letter Alphabet.
Journal of Automata, Languages and Combinatorics 7(4): 579-597 (2002) |
| 1999 |
|---|
| 18 | EE | Gwénaël Richomme,
Patrice Séébold:
Characterization of Test-sets for Overlap-free Morphisms.
Discrete Applied Mathematics 98(1-2): 151-157 (1999) |
| 1998 |
|---|
| 17 | EE | Patrice Séébold:
On the Conjugation of Standard Morphisms.
Theor. Comput. Sci. 195(1): 91-109 (1998) |
| 1997 |
|---|
| 16 | | Yuji Kobayashi,
Friedrich Otto,
Patrice Séébold:
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
COCOON 1997: 393-402 |
| 1996 |
|---|
| 15 | | Patrice Séébold:
On the Conjugation of Standard Morphisms.
MFCS 1996: 506-516 |
| 1994 |
|---|
| 14 | | Jean Berstel,
Patrice Séébold:
A Remark on Morphic Sturmian Words.
ITA 28(3-4): 255-263 (1994) |
| 1993 |
|---|
| 13 | | Filippo Mignosi,
Patrice Séébold:
If a D0L Language is k-Power Free then it is Circular.
ICALP 1993: 507-518 |
| 12 | | Jean Berstel,
Patrice Séébold:
A Characterization of Sturmian Morphisms.
MFCS 1993: 281-290 |
| 11 | EE | Jean Berstel,
Patrice Séébold:
A Characterization of Overlap-Free Morphisms.
Discrete Applied Mathematics 46(3): 275-281 (1993) |
| 1992 |
|---|
| 10 | | Julien Cassaigne,
Sylviane R. Schwer,
Patrice Séébold:
About Gauss codes.
Bulletin of the EATCS 48: 165-171 (1992) |
| 1991 |
|---|
| 9 | EE | Patrice Séébold,
Karine Slowinski:
The Shortest Way to Draw a Connected Picture.
Comput. Graph. Forum 10(4): 319-327 (1991) |
| 8 | | Patrice Séébold:
Fibonacci Morphisms and Sturmian Words.
Theor. Comput. Sci. 88(2): 365-384 (1991) |
| 1990 |
|---|
| 7 | | Patrice Séébold,
Karine Slowinski:
Minimizing Picture Words.
IMYCS 1990: 234-243 |
| 1989 |
|---|
| 6 | | Patrice Séébold:
About a Family of Binary Morphisms which Stationary Words are Sturmian.
FCT 1989: 384-394 |
| 1988 |
|---|
| 5 | | Patrice Séébold:
An effect solution to the DOL periodicity problem in the binary case.
Bulletin of the EATCS 36: 137-151 (1988) |
| 1986 |
|---|
| 4 | | Patrice Séébold:
Complément A L'étude des Suites de Thue-Morse Généralisées.
ITA 20(2): 157-181 (1986) |
| 1985 |
|---|
| 3 | | Patrice Séébold:
Generalized Thue-Morse sequences.
FCT 1985: 402-411 |
| 1984 |
|---|
| 2 | | Patrice Séébold:
Overlap-free sequences.
Automata on Infinite Words 1984: 207-215 |
| 1983 |
|---|
| 1 | | Patrice Séébold:
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
Theoretical Computer Science 1983: 301-311 |
