( en | de | ru )

 

Disambiguation of "Restivo, Antonio"

Author of the publication

copydeleteadd this publication to your clipboard
Forbidden Factors in Finite and Infinite Words.

, , and . Jewels are Forever, page 339-350. Springer, (1999)

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.

Antonio Wünsch

Antonio Nuzzo

Antonio Galeano

Antonio Souto

Antonio Peter

 

Other publications of authors with the same name

Forbidden Factors in Finite and Infinite Words., , and . Jewels are Forever, page 339-350. Springer, (1999)Tree Codes and Equations., and . Developments in Language Theory, page 119-133. Aristotle University of Thessaloniki, (1997)Hopcroft's Algorithm and Tree-like Automata., , and . ICTCS, page 75-81. (2009)L-Convex Polyominoes: A Survey., and . Formal Models, Languages and Applications, volume 66 of Series in Machine Perception and Artificial Intelligence, page 17-33. World Scientific, (2007)Some variations on Lyndon words., , and . CoRR, (2019)Burrows-Wheeler Transform and Run-Length Enconding., , , and . WORDS, volume 10432 of Lecture Notes in Computer Science, page 228-239. Springer, (2017)On Sets of Words of Rank Two., , and . WORDS, volume 11682 of Lecture Notes in Computer Science, page 46-59. Springer, (2019)Automata with Extremal Minimality Conditions., and . Developments in Language Theory, volume 6224 of Lecture Notes in Computer Science, page 399-410. Springer, (2010)Une Caractérisation des Langages Algébriques Bornés., and . RAIRO Theor. Informatics Appl., 11 (3): 203-205 (1977)Mots Sans Répétitions et Langages Rationnels Bornés.. RAIRO Theor. Informatics Appl., 11 (3): 197-202 (1977)