( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.

, , и . COCOON, том 1276 из Lecture Notes in Computer Science, стр. 393-402. Springer, (1997)

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.

Uwe Seebold

Irmtraud Seebold

Sabine Seebold

Elmar Seebold

Patrice Urayeneza

 

Другие публикации лиц с тем же именем

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