( en | de | ru )

 

Disambiguation of "Séébold, Patrice"

Author of the publication

copydeleteadd this publication to your clipboard
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.

. Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, page 301-311. Springer, (1983)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Uwe Seebold

Irmtraud Seebold

Elmar Seebold

Sabine Seebold

Patrice Mbaya

 

Other publications of authors with the same name

Generalized Thue-Morse sequences.. FCT, volume 199 of Lecture Notes in Computer Science, page 402-411. Springer, (1985)Overlap-freeness in infinite partial words., , , and . Theor. Comput. Sci., 410 (8-10): 943-948 (2009)On the Conjugation of Standard Morphisms.. MFCS, volume 1113 of Lecture Notes in Computer Science, page 506-516. Springer, (1996)Generating the Peano Curve and Counting Occurrences of some Patterns., , and . Journal of Automata, Languages and Combinatorics, 9 (4): 439-455 (2004)Counting Ordered Patterns in Words Generated by Morphisms., , and . LATA, volume 5196 of Lecture Notes in Computer Science, page 287-298. Springer, (2008)A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet., , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 393-402. Springer, (1997)A Characterization of Binary Morphisms Generating Lyndon Infinite Words., and . WORDS, volume 12847 of Lecture Notes in Computer Science, page 160-171. Springer, (2021)About a Family of Binary Morphisms which Stationary Words are Sturmian.. FCT, volume 380 of Lecture Notes in Computer Science, page 384-394. Springer, (1989)Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.. Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, page 301-311. Springer, (1983)Overlap-free sequences.. Automata on Infinite Words, volume 192 of Lecture Notes in Computer Science, page 207-215. Springer, (1984)