Patrice Séébold

According to our database, Patrice Séébold authored at least 36 papers between 1983 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A Characterization of Binary Morphisms Generating Lyndon Infinite Words.

Gwénaël Richomme, Patrice Séébold

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2018

Sturmian images of non Sturmian words and standard morphisms.

Patrice Séébold

Theor. Comput. Sci., 2018

Avoidability of circular formulas.

Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold

Theor. Comput. Sci., 2018

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

Length-k-overlap-free Binary Infinite Words.

Patrice Séébold

Fundam. Informaticae, 2012

2011

On factorially balanced sets of words.

Gwénaël Richomme, Patrice Séébold

Theor. Comput. Sci., 2011

2009

Overlap-freeness in infinite partial words.

Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold

Theor. Comput. Sci., 2009

2008

Look and Say Fibonacci.

Patrice Séébold

RAIRO Theor. Informatics Appl., 2008

Counting Ordered Patterns in Words Generated by Morphisms.

Sergey Kitaev, Toufik Mansour, Patrice Séébold

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Tag-systems for the Hilbert Curve.

Patrice Séébold

Discret. Math. Theor. Comput. Sci., 2007

2004

Generating the Peano Curve and Counting Occurrences of some Patterns.

Sergey Kitaev, Toufik Mansour, Patrice Séébold

J. Autom. Lang. Comb., 2004

Conjectures And Results On Morphisms Generating K-Power-Free Words.

Gwénaël Richomme, Patrice Séébold

Int. J. Found. Comput. Sci., 2004

2003

Lyndon factorization of the Prouhet words.

Patrice Séébold

Theor. Comput. Sci., 2003

On some generalizations of the Thue-Morse morphism.

Patrice Séébold

Theor. Comput. Sci., 2003

Foreword.

Patrice Séébold

Theor. Comput. Sci., 2003

2002

About some Overlap-Free Morphisms on a n-Letter Alphabet.

Patrice Séébold

J. Autom. Lang. Comb., 2002

2001

Some Properties of the Prouhet Morphism and Words.

Patrice Séébold

Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

1999

Characterization of Test-sets for Overlap-free Morphisms.

Gwénaël Richomme, Patrice Séébold

Discret. Appl. Math., 1999

1998

On the Conjugation of Standard Morphisms.

Patrice Séébold

Theor. Comput. Sci., 1998

1997

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.

Yuji Kobayashi, Friedrich Otto, Patrice Séébold

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1994

A Remark on Morphic Sturmian Words.

Jean Berstel, Patrice Séébold

RAIRO Theor. Informatics Appl., 1994

Redundant Retreat Free Words.

Patrice Séébold, Karine Slowinski

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

A Characterization of Overlap-Free Morphisms.

Jean Berstel, Patrice Séébold

Discret. Appl. Math., 1993

A Characterization of Sturmian Morphisms.

Jean Berstel, Patrice Séébold

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

If a D0L Language is k-Power Free then it is Circular.

Filippo Mignosi, Patrice Séébold

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

About Gauss codes.

Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold

Bull. EATCS, 1992

1991

Fibonacci Morphisms and Sturmian Words.

Patrice Séébold

Theor. Comput. Sci., 1991

The Shortest Way to Draw a Connected Picture.

Patrice Séébold, Karine Slowinski

Comput. Graph. Forum, 1991

1990

Minimizing Picture Words.

Patrice Séébold, Karine Slowinski

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

About a Family of Binary Morphisms which Stationary Words are Sturmian.

Patrice Séébold

Proceedings of the Fundamentals of Computation Theory, 1989

1988

An effect solution to the DOL periodicity problem in the binary case.

Patrice Séébold

Bull. EATCS, 1988

1986

Complément A L'étude des Suites de Thue-Morse Généralisées.

Patrice Séébold

RAIRO Theor. Informatics Appl., 1986

1985

Sequences generated by infinitely iterated morphisms.

Patrice Séébold

Discret. Appl. Math., 1985

Generalized Thue-Morse sequences.

Patrice Séébold

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Overlap-free sequences.

Patrice Séébold

Proceedings of the Automata on Infinite Words, 1984

1983

Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.

Patrice Séébold

Proceedings of the Theoretical Computer Science, 1983