Patrice Séébold - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2021

A Characterization of Binary Morphisms Generating Lyndon Infinite WordsGwénaël Richomme, Patrice Séébold. cwords 2021: 160-171 [doi]

2018

Avoidability of circular formulasGuilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold. TCS, 726:1-4, 2018. [doi]

Sturmian images of non Sturmian words and standard morphismsPatrice Séébold. TCS, 711:92-104, 2018. [doi]

2012

Completing a combinatorial proof of the rigidity of Sturmian words generated by morphismsGwénaël Richomme, Patrice Séébold. TCS, 428:92-97, 2012. [doi]

Length-k-overlap-free Binary Infinite WordsPatrice Séébold. FUIN, 116(1-4):251-263, 2012. [doi]

2011

On factorially balanced sets of wordsGwénaël Richomme, Patrice Séébold. TCS, 412(39):5492-5497, 2011. [doi]

2009

Overlap-freeness in infinite partial wordsVesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold. TCS, 410(8-10):943-948, 2009. [doi]

2008

Counting Ordered Patterns in Words Generated by MorphismsSergey Kitaev, Toufik Mansour, Patrice Séébold. LATA 2008: 287-298 [doi]

2007

Tag-systems for the Hilbert CurvePatrice Séébold. dmtcs, 9(2), 2007. [doi]

2004

Generating the Peano Curve and Counting Occurrences of some PatternsSergey Kitaev, Toufik Mansour, Patrice Séébold. jalc, 9(4):439-455, 2004.

Conjectures And Results On Morphisms Generating K-Power-Free WordsGwénaël Richomme, Patrice Séébold. ijfcs, 15(2):307-316, 2004. [doi]

2003

On some generalizations of the Thue-Morse morphismPatrice Séébold. TCS, 292(1):283-298, 2003.

Lyndon factorization of the Prouhet wordsPatrice Séébold. TCS, 307(1):179-197, 2003. [doi]

2002

About some Overlap-Free Morphisms on a n-Letter AlphabetPatrice Séébold. jalc, 7(4):579-597, 2002.

2001

Some Properties of the Prouhet Morphism and WordsPatrice Séébold. dcfs 2001: 177-186

1999

Characterization of Test-sets for Overlap-free MorphismsGwénaël Richomme, Patrice Séébold. DAM, 98(1-2):151-157, 1999. [doi]

1998

On the Conjugation of Standard MorphismsPatrice Séébold. TCS, 195(1):91-109, 1998. [doi]

1997

A Complete Characterization of Repetitive Morphisms over the Two-Letter AlphabetYuji Kobayashi, Friedrich Otto, Patrice Séébold. cocoon 1997: 393-402

1996

On the Conjugation of Standard MorphismsPatrice Séébold. mfcs 1996: 506-516

1994

A Remark on Morphic Sturmian WordsJean Berstel, Patrice Séébold. ita, 28(3-4):255-263, 1994.

Redundant Retreat Free WordsPatrice Séébold, Karine Slowinski. In Gheorghe Paun, editor, Mathematical Aspects of Natural and Formal Languages. Volume 43 of World scientific series in computer science, pages 419-430, World Scientific, 1994. [doi]

1993

A Characterization of Sturmian MorphismsJean Berstel, Patrice Séébold. mfcs 1993: 281-290

A Characterization of Overlap-Free MorphismsJean Berstel, Patrice Séébold. DAM, 46(3):275-281, 1993. [doi]

If a D0L Language is k-Power Free then it is CircularFilippo Mignosi, Patrice Séébold. icalp 1993: 507-518

1992

About Gauss codesJulien Cassaigne, Sylviane R. Schwer, Patrice Séébold. eatcs, 48:165-171, 1992.

1991

The Shortest Way to Draw a Connected PicturePatrice Séébold, Karine Slowinski. cgf, 10(4):319-327, 1991. [doi]

Fibonacci Morphisms and Sturmian WordsPatrice Séébold. TCS, 88(2):365-384, 1991.

1990

Minimizing Picture WordsPatrice Séébold, Karine Slowinski. imycs 1990: 234-243

1989

About a Family of Binary Morphisms which Stationary Words are SturmianPatrice Séébold. fct 1989: 384-394

1988

An effect solution to the DOL periodicity problem in the binary casePatrice Séébold. eatcs, 36:137-151, 1988.

1986

Complément A L étude des Suites de Thue-Morse GénéraliséesPatrice Séébold. ita, 20(2):157-181, 1986.

1985

Generalized Thue-Morse sequencesPatrice Séébold. fct 1985: 402-411

Sequences generated by infinitely iterated morphismsPatrice Séébold. DAM, 11(3):255-264, 1985. [doi]

1984

Overlap-free sequencesPatrice Séébold. litp 1985: 207-215

1983

Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescritsPatrice Séébold. tcs 1982: 301-311

Sign in or sign up to see more results.

runs on WebDSL