Author of the publication

String Attractors and Infinite Words.

, , and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 426-442. Springer, (2022)

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.

 

Other publications of authors with the same name

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)Hopcroft's Algorithm and Tree-like Automata., , and . ICTCS, page 75-81. (2009)Sorting Suffixes of a Text via its Lyndon Factorization., , , and . Stringology, page 119-127. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Some variations on Lyndon words., , and . CoRR, (2019)On Some Properties of Very Pure Codes., and . Theor. Comput. Sci., (1980)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)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)