( en | de | ru )

 

Disambiguation of "Kobayashi, Yuji"

Author of the publication

copydeleteadd this publication to your clipboard
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.

, , and . RTA, volume 1232 of Lecture Notes in Computer Science, page 53-67. Springer, (1997)

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.

Yuji Kera

Yuji Ishida

Yuji Nagamachi

Yoshitake Kobayashi

Yuji Takahashi

 

Other publications of authors with the same name

The Ulam Type Stability of a Generalized Additive Mapping and Concrete Examples., , , , and . Int. J. Math. Mathematical Sciences, (2013)A complex event processing for large-scale M2M services and its performance evaluations., , , and . DEBS, page 336-339. ACM, (2015)A scalable complex event processing system and evaluations of its performance., , , , , and . DEBS, page 123-126. ACM, (2012)Undecidability Results for Monoids with Linear-Time Decidable Word Problems., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 278-289. Springer, (2000)A novel lattice structure of M-channel paraunitary filter banks., and . ISCAS (5), page 4293-4296. IEEE, (2005)A complete classification of continuous fractional operations on \(C\)., , and . Period. Math. Hung., 75 (2): 345-355 (2017)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., and . Int. J. Algebra Comput., 12 (1-2): 247-283 (2002)The derivational complexity of string rewriting systems.. Theor. Comput. Sci., (2012)Undecidable properties of monoids with word problem solvable in linear time., and . Theor. Comput. Sci., 290 (3): 1301-1316 (2003)