Patrice Séébold

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Sturmian images of non Sturmian words and standard morphisms.
Theor. Comput. Sci., 2018

Avoidability of circular formulas.
Theor. Comput. Sci., 2018

2016
Avoidability of circular formulas.
CoRR, 2016

2012
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms.
Theor. Comput. Sci., 2012

Length-k-overlap-free Binary Infinite Words.
Fundam. Inform., 2012

2011
On factorially balanced sets of words.
Theor. Comput. Sci., 2011

2009
Overlap-freeness in infinite partial words.
Theor. Comput. Sci., 2009

2008
Look and Say Fibonacci.
ITA, 2008

Counting Ordered Patterns in Words Generated by Morphisms.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
Tag-systems for the Hilbert Curve.
Discrete Mathematics & Theoretical Computer Science, 2007

2004
Generating the Peano Curve and Counting Occurrences of some Patterns.
Journal of Automata, Languages and Combinatorics, 2004

Conjectures And Results On Morphisms Generating K-Power-Free Words.
Int. J. Found. Comput. Sci., 2004

2003
Lyndon factorization of the Prouhet words.
Theor. Comput. Sci., 2003

On some generalizations of the Thue-Morse morphism.
Theor. Comput. Sci., 2003

Foreword.
Theor. Comput. Sci., 2003

2002
About some Overlap-Free Morphisms on a n-Letter Alphabet.
Journal of Automata, Languages and Combinatorics, 2002

2001
Some Properties of the Prouhet Morphism and Words.
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.
Discrete Applied Mathematics, 1999

1998
On the Conjugation of Standard Morphisms.
Theor. Comput. Sci., 1998

1997
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
On the Conjugation of Standard Morphisms.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1994
A Remark on Morphic Sturmian Words.
ITA, 1994

1993
A Characterization of Overlap-Free Morphisms.
Discrete Applied Mathematics, 1993

A Characterization of Sturmian Morphisms.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

If a D0L Language is k-Power Free then it is Circular.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
About Gauss codes.
Bulletin of the EATCS, 1992

1991
Fibonacci Morphisms and Sturmian Words.
Theor. Comput. Sci., 1991

The Shortest Way to Draw a Connected Picture.
Comput. Graph. Forum, 1991

1990
Minimizing Picture Words.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989
About a Family of Binary Morphisms which Stationary Words are Sturmian.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
An effect solution to the DOL periodicity problem in the binary case.
Bulletin of the EATCS, 1988

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

1985
Sequences generated by infinitely iterated morphisms.
Discrete Applied Mathematics, 1985

Generalized Thue-Morse sequences.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Overlap-free sequences.
Proceedings of the Automata on Infinite Words, 1984

1983
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
Proceedings of the Theoretical Computer Science, 1983


  Loading...