Yuji Kobayashi

According to our database, Yuji Kobayashi authored at least 27 papers between 1986 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

A complete classification of continuous fractional operations on \(\mathbb {C}\).

Yuji Kobayashi, Sin-Ei Takahasi, Makoto Tsukada

Period. Math. Hung., 2017

2015

A complex event processing for large-scale M2M services and its performance evaluations.

Yuji Kobayashi, Kazuhiko Isoyama, Koji Kida, Hiroki Tagato

Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems, 2015

2013

The Ulam Type Stability of a Generalized Additive Mapping and Concrete Examples.

Hiroyoshi Oda, Makoto Tsukada, Takeshi Miura, Yuji Kobayashi, Sin-Ei Takahasi

Int. J. Math. Math. Sci., 2013

2012

The derivational complexity of string rewriting systems.

Yuji Kobayashi

Theor. Comput. Sci., 2012

A scalable complex event processing system and evaluations of its performance.

Kazuhiko Isoyama, Yuji Kobayashi, Tadashi Sato, Koji Kida, Makiko Yoshida, Hiroki Tagato

Proceedings of the Sixth ACM International Conference on Distributed Event-Based Systems, 2012

2007

The Homological Finiteness Property FP₁ and Finite Generation of Monoids.

Yuji Kobayashi

Int. J. Algebra Comput., 2007

2005

A novel lattice structure of M-channel paraunitary filter banks.

Morio Ikehara, Yuji Kobayashi

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2003

Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.

Masashi Katsura, Yuji Kobayashi, Friedrich Otto

Theor. Comput. Sci., 2003

Undecidable properties of monoids with word problem solvable in linear time.

Masashi Katsura, Yuji Kobayashi

Theor. Comput. Sci., 2003

2002

Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid.

Yuji Kobayashi, Friedrich Otto

Int. J. Algebra Comput., 2002

2001

Termination and derivational complexity of confluent one-rule string-rewriting systems.

Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji

Theor. Comput. Sci., 2001

On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids.

Yuji Kobayashi, Friedrich Otto

Int. J. Algebra Comput., 2001

2000

Repetitiveness of languages generated by morphisms.

Yuji Kobayashi, Friedrich Otto

Theor. Comput. Sci., 2000

Reconfigurable optical interconnections for parallel computing.

Neil McArdle, Makoto Naruse, Haruyoshi Toyoda, Yuji Kobayashi, Masatoshi Ishikawa

Proc. IEEE, 2000

Undecidability Results for Monoids with Linear-Time Decidable Word Problems.

Masashi Katsura, Yuji Kobayashi, Friedrich Otto

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.

Friedrich Otto, Masashi Katsura, Yuji Kobayashi

J. Symb. Comput., 1998

1997

On Termination of Confluent One-Rule String-Rewriting Systems.

Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi

Inf. Process. Lett., 1997

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.

Friedrich Otto, Masashi Katsura, Yuji Kobayashi

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.

Yuji Kobayashi, Friedrich Otto

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Finding all Solutions of a Hysteresis Associative Memory.

Yuji Kobayashi, Toshimichi Saito, Kenya Jin'no

Proceedings of the Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, 1997

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.

Yuji Kobayashi, Friedrich Otto, Patrice Séébold

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey.

Friedrich Otto, Yuji Kobayashi

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1995

A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation.

Yuji Kobayashi

Theor. Comput. Sci., 1995

1994

A Finiteness Condition for Rewriting Systems.

Craig C. Squier, Friedrich Otto, Yuji Kobayashi

Theor. Comput. Sci., 1994

1993

The Shuffle Algebra and its Derivations.

Masashi Katsura, Yuji Kobayashi

Theor. Comput. Sci., 1993

1988

Enumeration of irreducible binary words.

Yuji Kobayashi

Discret. Appl. Math., 1988

1986

Repetition-Free Words.

Yuji Kobayashi

Theor. Comput. Sci., 1986