Author of the publication

Degrees of Infinite Words, Polynomials and Atoms.

, , , and . DLT, volume 9840 of Lecture Notes in Computer Science, page 164-176. Springer, (2016)

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

Unique decipherability in the additive monoid of sets of numbers.. RAIRO Theor. Informatics Appl., 45 (2): 225-234 (2011)Word Equations Where a Power Equals a Product of Powers.. STACS, volume 66 of LIPIcs, page 55:1-55:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Standard words and solutions of the word equation $X_1^2 X_n^2 = (X_1 X_n)^2$., and . CoRR, (2020)Ultimately Constant Abelian Complexity of Infinite Words.. Journal of Automata, Languages and Combinatorics, 14 (3/4): 255-258 (2009)An Analysis and a Reproof of Hmelevskii's Theorem., and . Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 467-478. Springer, (2008)On the Solution Sets of Entire Systems of Word Equations.. WORDS, volume 13899 of Lecture Notes in Computer Science, page 261-273. Springer, (2023)Degrees of Infinite Words, Polynomials and Atoms., , , and . DLT, volume 9840 of Lecture Notes in Computer Science, page 164-176. Springer, (2016)An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences., and . ICALP, volume 107 of LIPIcs, page 136:1-136:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Local Squares, Periodicity and Finite Automata., , , and . Rainbow of Computer Science, volume 6570 of Lecture Notes in Computer Science, page 90-101. Springer, (2011)Fine and Wilf's Theorem for k-Abelian Periods., , and . Int. J. Found. Comput. Sci., 24 (7): 1135-1152 (2013)