( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory.

. Theor. Comput. Sci., 108 (1): 103-118 (1993)

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.

Juhani Sarubin

Juhani Kostka

Juhani Toivanen

Juhani Ilmarinen

Juhani Koponen

 

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

The Unique Decipherability in the Monoid of Regular Languages is Undecidable., и . Fundam. Informaticae, 110 (1-4): 197-200 (2011)Compactness of Systems of Equations on Completely Regular Semigroups., , и . Structures in Logic and Computer Science, том 1261 из Lecture Notes in Computer Science, стр. 268-280. Springer, (1997)Unique Decipherability in the Monoid of Languages: An Application of Rational Relations., и . Theory Comput. Syst., 49 (2): 355-364 (2011)Fine and Wilf's Theorem for k-Abelian Periods., , и . Int. J. Found. Comput. Sci., 24 (7): 1135-1152 (2013)On k-abelian palindromes., , и . Inf. Comput., (2018)Decidability of the Multiplicity Equivalence of Multitape Finite Automata, и . STOC, стр. 477-481. ACM, (1990)Local Squares, Periodicity and Finite Automata., , , и . Rainbow of Computer Science, том 6570 из Lecture Notes in Computer Science, стр. 90-101. Springer, (2011)On Defect Effect of Bi-Infinite Words., , и . MFCS, том 1450 из Lecture Notes in Computer Science, стр. 674-682. Springer, (1998)On the Size of Independent Systems of Equations in Semigroups., и . MFCS, том 841 из Lecture Notes in Computer Science, стр. 443-452. Springer, (1994)Systems of Equations over a Finite Set of Words and Automata Theory.. IWWERT, том 572 из Lecture Notes in Computer Science, стр. 247-249. Springer, (1990)