Yuji Kobayashi

Publication Activity (10 Years)

Years Active: 1986-2017
Publications (10 Years): 1

Top Topics

Complex Event Processing

Predictive Data Mining

Generalized Additive

Top Venues

Int. J. Math. Math. Sci.

Theor. Comput. Sci.

Period. Math. Hung.

Publications

Yuji Kobayashi, Sin-Ei Takahasi, Makoto Tsukada
A complete classification of continuous fractional operations on \(\mathbb {C}\). Period. Math. Hung. 75 (2) (2017)
Yuji Kobayashi, Kazuhiko Isoyama, Koji Kida, Hiroki Tagato
A complex event processing for large-scale M2M services and its performance evaluations. DEBS (2015)
Hiroyoshi Oda, Makoto Tsukada, Takeshi Miura, Yuji Kobayashi, Sin-Ei Takahasi
The Ulam Type Stability of a Generalized Additive Mapping and Concrete Examples. Int. J. Math. Math. Sci. 2013 (2013)
Kazuhiko Isoyama, Yuji Kobayashi, Tadashi Sato, Koji Kida, Makiko Yoshida, Hiroki Tagato
A scalable complex event processing system and evaluations of its performance. DEBS (2012)
Yuji Kobayashi
The derivational complexity of string rewriting systems. Theor. Comput. Sci. 438 (2012)
Yuji Kobayashi
and Finite Generation of Monoids. Int. J. Algebra Comput. 17 (3) (2007)
Morio Ikehara, Yuji Kobayashi
A novel lattice structure of M-channel paraunitary filter banks. ISCAS (5) (2005)
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions. Theor. Comput. Sci. 301 (1-3) (2003)
Masashi Katsura, Yuji Kobayashi
Undecidable properties of monoids with word problem solvable in linear time. Theor. Comput. Sci. 290 (3) (2003)
Yuji Kobayashi, Friedrich Otto
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. Int. J. Algebra Comput. 12 (1-2) (2002)
Yuji Kobayashi, Friedrich Otto
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. Int. J. Algebra Comput. 11 (3) (2001)
Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
Termination and derivational complexity of confluent one-rule string-rewriting systems. Theor. Comput. Sci. 262 (1) (2001)
Yuji Kobayashi, Friedrich Otto
Repetitiveness of languages generated by morphisms. Theor. Comput. Sci. 240 (2) (2000)
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC (2000)
Neil McArdle, Makoto Naruse, Haruyoshi Toyoda, Yuji Kobayashi, Masatoshi Ishikawa
Reconfigurable optical interconnections for parallel computing. Proc. IEEE 88 (6) (2000)
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. J. Symb. Comput. 26 (5) (1998)
Yuji Kobayashi, Friedrich Otto, Patrice Séébold
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. COCOON (1997)
Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi
On Termination of Confluent One-Rule String-Rewriting Systems. Inf. Process. Lett. 61 (2) (1997)
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. RTA (1997)
Yuji Kobayashi, Friedrich Otto
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. MFCS (1997)
Yuji Kobayashi, Toshimichi Saito, Kenya Jin'no
Finding all Solutions of a Hysteresis Associative Memory. ICONIP (2) (1997)
Friedrich Otto, Yuji Kobayashi
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. Advances in Algorithms, Languages, and Complexity (1997)
Yuji Kobayashi
A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation. Theor. Comput. Sci. 146 (1&2) (1995)
Craig C. Squier, Friedrich Otto, Yuji Kobayashi
A Finiteness Condition for Rewriting Systems. Theor. Comput. Sci. 131 (2) (1994)
Masashi Katsura, Yuji Kobayashi
The Shuffle Algebra and its Derivations. Theor. Comput. Sci. 115 (2) (1993)
Yuji Kobayashi
Enumeration of irreducible binary words. Discret. Appl. Math. 20 (3) (1988)
Yuji Kobayashi
Repetition-Free Words. Theor. Comput. Sci. 44 (1986)