| 2007 |
|---|
| 19 | EE | Yuji Kobayashi:
The Homological Finiteness Property FP1 and Finite Generation of Monoids.
IJAC 17(3): 593-605 (2007) |
| 2005 |
|---|
| 18 | EE | Morio Ikehara,
Yuji Kobayashi:
A novel lattice structure of M-channel paraunitary filter banks.
ISCAS (5) 2005: 4293-4296 |
| 2003 |
|---|
| 17 | EE | 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. 1-3(301): 79-101 (2003) |
| 16 | | Masashi Katsura,
Yuji Kobayashi:
Undecidable properties of monoids with word problem solvable in linear time.
Theor. Comput. Sci. 290(3): 1301-1316 (2003) |
| 2002 |
|---|
| 15 | EE | Yuji Kobayashi,
Friedrich Otto:
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid.
IJAC 12(1-2): 247-283 (2002) |
| 2001 |
|---|
| 14 | EE | Yuji Kobayashi,
Friedrich Otto:
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids.
IJAC 11(3): 391-403 (2001) |
| 13 | EE | Yuji Kobayashi,
Masashi Katsura,
Kayoko Shikishima-Tsuji:
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci. 262(1): 583-632 (2001) |
| 2000 |
|---|
| 12 | EE | Masashi Katsura,
Yuji Kobayashi,
Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
ISAAC 2000: 278-289 |
| 11 | EE | Yuji Kobayashi,
Friedrich Otto:
Repetitiveness of languages generated by morphisms.
Theor. Comput. Sci. 240(2): 337-378 (2000) |
| 1998 |
|---|
| 10 | | Friedrich Otto,
Masashi Katsura,
Yuji Kobayashi:
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput. 26(5): 621-648 (1998) |
| 1997 |
|---|
| 9 | | 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: 225-266 |
| 8 | | Yuji Kobayashi,
Friedrich Otto,
Patrice Séébold:
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
COCOON 1997: 393-402 |
| 7 | | Yuji Kobayashi,
Friedrich Otto:
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.
MFCS 1997: 337-346 |
| 6 | | Friedrich Otto,
Masashi Katsura,
Yuji Kobayashi:
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
RTA 1997: 53-67 |
| 5 | EE | Kayoko Shikishima-Tsuji,
Masashi Katsura,
Yuji Kobayashi:
On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett. 61(2): 91-96 (1997) |
| 1995 |
|---|
| 4 | EE | Yuji Kobayashi:
A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation.
Theor. Comput. Sci. 146(1&2): 321-329 (1995) |
| 1994 |
|---|
| 3 | | Craig C. Squier,
Friedrich Otto,
Yuji Kobayashi:
A Finiteness Condition for Rewriting Systems.
Theor. Comput. Sci. 131(2): 271-294 (1994) |
| 1993 |
|---|
| 2 | | Masashi Katsura,
Yuji Kobayashi:
The Shuffle Algebra and its Derivations.
Theor. Comput. Sci. 115(2): 359-369 (1993) |
| 1986 |
|---|
| 1 | | Yuji Kobayashi:
Repetition-Free Words.
Theor. Comput. Sci. 44: 175-197 (1986) |
