( en | de | ru )

 

Disambiguation of "Saarela, Aleksi"

Author of the publication

copydeleteadd this publication to your clipboard
The Unique Decipherability in the Monoid of Regular Languages is Undecidable.

, and . Fundam. Informaticae, 110 (1-4): 197-200 (2011)

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.

Aleksi Vuorinen

Sascha Aleksi

Jelena Aleksi

Mario Aleksi

Stojanka Aleksi

 

Other publications of authors with the same name

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence., , and . Acta Cybern., 23 (1): 175-189 (2017)Ultimately Constant Abelian Complexity of Infinite Words.. Journal of Automata, Languages and Combinatorics, 14 (3/4): 255-258 (2009)Unique decipherability in the additive monoid of sets of numbers.. RAIRO Theor. Informatics Appl., 45 (2): 225-234 (2011)Standard words and solutions of the word equation $X_1^2 X_n^2 = (X_1 X_n)^2$., and . CoRR, (2020)Word equations with kth powers of variables.. J. Comb. Theory, Ser. A, (2019)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)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)Separating the Words of a Language by Counting Factors.. Fundam. Informaticae, 180 (4): 375-393 (2021)Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2., and . J. Comb. Theory, Ser. A, (2021)3-Abelian Cubes Are Avoidable on Binary Alphabets., and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 374-383. Springer, (2013)