( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.

, , и . ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 278-289. Springer, (2000)

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.

Yuji Kera

Yuji Ishida

Yuji Nagamachi

Yuji Nawata

Yoshitake Kobayashi

 

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

Repetitiveness of D0L-Languages Is Decidable in Polynomial Time., и . MFCS, том 1295 из Lecture Notes in Computer Science, стр. 337-346. Springer, (1997)On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids., и . Int. J. Algebra Comput., 11 (3): 391-403 (2001)The Homological Finiteness Property FP1 and Finite Generation of Monoids.. Int. J. Algebra Comput., 17 (3): 593-605 (2007)Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid., и . Int. J. Algebra Comput., 12 (1-2): 247-283 (2002)A novel lattice structure of M-channel paraunitary filter banks., и . ISCAS (5), стр. 4293-4296. IEEE, (2005)A complex event processing for large-scale M2M services and its performance evaluations., , , и . DEBS, стр. 336-339. ACM, (2015)A scalable complex event processing system and evaluations of its performance., , , , , и . DEBS, стр. 123-126. ACM, (2012)Undecidability Results for Monoids with Linear-Time Decidable Word Problems., , и . ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 278-289. Springer, (2000)Cross-Sections for Finitely Presented Monoids with Decidable Word Problems., , и . RTA, том 1232 из Lecture Notes in Computer Science, стр. 53-67. Springer, (1997)A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet., , и . COCOON, том 1276 из Lecture Notes in Computer Science, стр. 393-402. Springer, (1997)