Patrice Séébold

Publication Activity (10 Years)

Years Active: 1983-2021
Publications (10 Years): 5

Top Topics

Automatically Generating

Harmonic Functions

Word Sense Disambiguation

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

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