( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reconstructing Words Using Queries on Subwords or Factors.

, и . STACS, том 254 из LIPIcs, стр. 52:1-52:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Gwenaël Delaval

 

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

Greedy Palindromic Lengths., и . Int. J. Found. Comput. Sci., 29 (3): 331-356 (2018)Sudo-Lyndon. CoRR, (2007)Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property.. Int. J. Found. Comput. Sci., 30 (1): 171-196 (2019)Optimality of some algorithms to detect quasiperiodicities., и . Theor. Comput. Sci., 411 (34-36): 3110-3122 (2010)Periodicity in rectangular arrays., , , и . Inf. Process. Lett., (2017)A Characterization of Binary Morphisms Generating Lyndon Infinite Words., и . WORDS, том 12847 из Lecture Notes in Computer Science, стр. 160-171. Springer, (2021)Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory)., и . Bulletin of the EATCS, (2004)Another Characterization of Sturmian Words.. Bulletin of the EATCS, (1999)Balance and Abelian complexity of the Tribonacci word., , и . Adv. Appl. Math., 45 (2): 212-231 (2010)Determining Sets of Quasiperiods of Infinite Words., и . MFCS, том 58 из LIPIcs, стр. 40:1-40:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)