Patrice Séébold · EDBT 2026 Demo

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 11 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Automata and formal languages · 50% Combinatorics and discrete mathematics · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Combinatorics and discrete mathematics combinatorics on words	0.0	1	1993	If a D0L Language is k-Power Free then it is Circular · ICALP 1993
Automata and formal languages l systems	0.0	1	1993	If a D0L Language is k-Power Free then it is Circular · ICALP 1993

Year	Publication	Venue	Position
2018	Avoidability of circular formulas Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold	Theor. Comput. Sci.	4
2018	Sturmian images of non Sturmian words and standard morphisms Patrice Séébold	Theor. Comput. Sci.	1
2012	Length-k-overlap-free Binary Infinite Words abstract We study length-k-overlap-free binary infinite words, i.e., binary infinite words which can contain only overlaps xyxyx with \|x\| ≤ k − 1. We prove that no such word can be generated by a morphism, except if k = 1. On the other hand, for every k ≥ 2, Patrice Séébold	Fundam. Informaticae	1
2012	Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms Gwénaël Richomme, Patrice Séébold	Theor. Comput. Sci.	2
2011	On factorially balanced sets of words Gwénaël Richomme, Patrice Séébold	Theor. Comput. Sci.	2
2009	Overlap-freeness in infinite partial words Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold	Theor. Comput. Sci.	4
2008	Counting Ordered Patterns in Words Generated by Morphisms Sergey Kitaev, Toufik Mansour, Patrice Séébold	LATA	3
2003	Foreword Patrice Séébold	Theor. Comput. Sci.	1
2003	On some generalizations of the Thue-Morse morphism Patrice Séébold	Theor. Comput. Sci.	1
2003	Lyndon factorization of the Prouhet words Patrice Séébold	Theor. Comput. Sci.	1
1999	Characterization of Test-sets for Overlap-free Morphisms Gwénaël Richomme, Patrice Séébold	Discret. Appl. Math.	2
1998	On the Conjugation of Standard Morphisms Patrice Séébold	Theor. Comput. Sci.	1
1997	A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet Yuji Kobayashi, Friedrich Otto, Patrice Séébold	COCOON	3
1996	On the Conjugation of Standard Morphisms Patrice Séébold	MFCS	1
1993	If a D0L Language is k-Power Free then it is Circular Filippo Mignosi, Patrice Séébold	ICALP	2
1993	A Characterization of Sturmian Morphisms Jean Berstel, Patrice Séébold	MFCS	2
1993	A Characterization of Overlap-Free Morphisms Jean Berstel, Patrice Séébold	Discret. Appl. Math.	2
1991	The Shortest Way to Draw a Connected Picture abstract With any word over the alphabet Π={r, r̄, u, ū}, we associate a connected picture in the following manner: the reading of each letter of this word induces a unit line: r (r̄, u, ū respectively) stands for a right (left, up, down respectively) move. We present a rewriting system which can yield, from any word over Π, all the words describing the same picture. Particularly, we give an algorithm to find a minimal word describing a given picture: this word represents the shortest way to draw this picture without ‘penup’. Patrice Séébold, Karine Slowinski	Comput. Graph. Forum	1
1991	Fibonacci Morphisms and Sturmian Words Patrice Séébold	Theor. Comput. Sci.	1
1989	About a Family of Binary Morphisms which Stationary Words are Sturmian Patrice Séébold	FCT	1
1985	Generalized Thue-Morse sequences Patrice Séébold	FCT	1
1985	Sequences generated by infinitely iterated morphisms Patrice Séébold	Discret. Appl. Math.	1