Yuji Kobayashi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2017

A complete classification of continuous fractional operations on \(\mathbb {C}\)Yuji Kobayashi, Sin-Ei Takahasi, Makoto Tsukada. pmh, 75(2):345-355, 2017. [doi]

2015

A complex event processing for large-scale M2M services and its performance evaluationsYuji Kobayashi, Kazuhiko Isoyama, Koji Kida, Hiroki Tagato. debs 2015: 336-339 [doi]

2013

The Ulam Type Stability of a Generalized Additive Mapping and Concrete ExamplesHiroyoshi Oda, Makoto Tsukada, Takeshi Miura, Yuji Kobayashi, Sin-Ei Takahasi. ijmmsc, 2013, 2013. [doi]

2012

A scalable complex event processing system and evaluations of its performanceKazuhiko Isoyama, Yuji Kobayashi, Tadashi Sato, Koji Kida, Makiko Yoshida, Hiroki Tagato. debs 2012: 123-126 [doi]

The derivational complexity of string rewriting systemsYuji Kobayashi. TCS, 438:1-12, 2012. [doi]

2007

The Homological Finiteness Property FP::1:: and Finite Generation of MonoidsYuji Kobayashi. ijac, 17(3):593-605, 2007. [doi]

2005

A novel lattice structure of M-channel paraunitary filter banksMorio Ikehara, Yuji Kobayashi. iscas 2005: 4293-4296 [doi]

2003

Undecidable properties of monoids with word problem solvable in linear timeMasashi Katsura, Yuji Kobayashi. TCS, 290(3):1301-1316, 2003.

Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditionsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. TCS, 1-3(301):79-101, 2003. [doi]

2002

Some Exact Sequences for The Homotopy (Bi-)Module af A MonoidYuji Kobayashi, Friedrich Otto. ijac, 12(1-2):247-283, 2002. [doi]

2001

Termination and derivational complexity of confluent one-rule string-rewriting systemsYuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji. TCS, 262(1):583-632, 2001. [doi]

On Homotopical and Homological Finiteness Conditions for Finitely Presented MonoidsYuji Kobayashi, Friedrich Otto. ijac, 11(3):391-403, 2001. [doi]

2000

Undecidability Results for Monoids with Linear-Time Decidable Word ProblemsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. isaac 2000: 278-289 [doi]

Repetitiveness of languages generated by morphismsYuji Kobayashi, Friedrich Otto. TCS, 240(2):337-378, 2000. [doi]

Reconfigurable optical interconnections for parallel computingNeil McArdle, Makoto Naruse, Haruyoshi Toyoda, Yuji Kobayashi, Masatoshi Ishikawa. pieee, 88(6):829-837, 2000. [doi]

1998

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented MonoidsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. JSC, 26(5):621-648, 1998.

1997

1995

A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete PresentationYuji Kobayashi. TCS, 146(1&2):321-329, 1995. [doi]

1994

A Finiteness Condition for Rewriting SystemsCraig C. Squier, Friedrich Otto, Yuji Kobayashi. TCS, 131(2):271-294, 1994.

1993

The Shuffle Algebra and its DerivationsMasashi Katsura, Yuji Kobayashi. TCS, 115(2):359-369, 1993.

1988

Enumeration of irreducible binary wordsYuji Kobayashi. DAM, 20(3):221-232, 1988. [doi]

1986

Repetition-Free WordsYuji Kobayashi. TCS, 44:175-197, 1986.

Sign in or sign up to see more results.

runs on WebDSL