Search the dblp DataBase

Publications of Author

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