Author of the publication

On the k-Hamming and k-Edit Distances.

, , , , , and . ICTCS, volume 3587 of CEUR Workshop Proceedings, page 143-156. CEUR-WS.org, (2023)

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

A Trie-Based Approach for Compacting Automata., , , and . CPM, volume 3109 of Lecture Notes in Computer Science, page 145-158. Springer, (2004)On the Suffix Automaton with Mismatches., , , and . CIAA, volume 4783 of Lecture Notes in Computer Science, page 144-156. Springer, (2007)On Sturmian graphs., , , and . Discret. Appl. Math., 155 (8): 1014-1030 (2007)Linear-size suffix tries., , , and . Theor. Comput. Sci., (2016)A multidimensional critical factorization theorem., and . Theor. Comput. Sci., 346 (2-3): 265-280 (2005)On a conjecture on bidimensional words., , and . Theor. Comput. Sci., 299 (1-3): 123-150 (2003)Sturmian graphs and integer representations over numeration systems., , , , and . Discret. Appl. Math., 160 (4-5): 536-547 (2012)From Nerode's congruence to suffix automata with mismatches., , , and . Theor. Comput. Sci., 410 (37): 3471-3480 (2009)Languages with Mismatches and an Application to Approximate Indexing., , and . Developments in Language Theory, volume 3572 of Lecture Notes in Computer Science, page 224-235. Springer, (2005)Sturmian Graphs and a Conjecture of Moser., , , and . Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 175-187. Springer, (2004)