default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuji Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j18]Yuji Kobayashi, Sin-Ei Takahasi, Makoto Tsukada:
A complete classification of continuous fractional operations on \(\mathbb {C}\). Period. Math. Hung. 75(2): 345-355 (2017)- 2015
- [c9]Yuji Kobayashi, Kazuhiko Isoyama, Koji Kida, Hiroki Tagato:
A complex event processing for large-scale M2M services and its performance evaluations. DEBS 2015: 336-339 - 2013
- [j17]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: 109754:1-109754:7 (2013) - 2012
- [j16]Yuji Kobayashi:
The derivational complexity of string rewriting systems. Theor. Comput. Sci. 438: 1-12 (2012) - [c8]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: 123-126
2000 – 2009
- 2007
- [j15]Yuji Kobayashi:
The Homological Finiteness Property FP1 and Finite Generation of Monoids. Int. J. Algebra Comput. 17(3): 593-605 (2007) - 2005
- [c7]Morio Ikehara, Yuji Kobayashi:
A novel lattice structure of M-channel paraunitary filter banks. ISCAS (5) 2005: 4293-4296 - 2003
- [j14]Masashi Katsura, Yuji Kobayashi:
Undecidable properties of monoids with word problem solvable in linear time. Theor. Comput. Sci. 290(3): 1301-1316 (2003) - [j13]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): 79-101 (2003) - 2002
- [j12]Yuji Kobayashi, Friedrich Otto:
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. Int. J. Algebra Comput. 12(1-2): 247-283 (2002) - 2001
- [j11]Yuji Kobayashi, Friedrich Otto:
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. Int. J. Algebra Comput. 11(3): 391-403 (2001) - [j10]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
- [j9]Neil McArdle, Makoto Naruse, Haruyoshi Toyoda, Yuji Kobayashi, Masatoshi Ishikawa:
Reconfigurable optical interconnections for parallel computing. Proc. IEEE 88(6): 829-837 (2000) - [j8]Yuji Kobayashi, Friedrich Otto:
Repetitiveness of languages generated by morphisms. Theor. Comput. Sci. 240(2): 337-378 (2000) - [c6]Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC 2000: 278-289
1990 – 1999
- 1998
- [j7]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
- [j6]Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi:
On Termination of Confluent One-Rule String-Rewriting Systems. Inf. Process. Lett. 61(2): 91-96 (1997) - [c5]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 - [c4]Yuji Kobayashi, Friedrich Otto, Patrice Séébold:
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. COCOON 1997: 393-402 - [c3]Yuji Kobayashi, Toshimichi Saito, Kenya Jin'no:
Finding all Solutions of a Hysteresis Associative Memory. ICONIP (2) 1997: 890-893 - [c2]Yuji Kobayashi, Friedrich Otto:
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. MFCS 1997: 337-346 - [c1]Friedrich Otto, Masashi Katsura, Yuji Kobayashi:
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. RTA 1997: 53-67 - 1995
- [j5]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
- [j4]Craig C. Squier, Friedrich Otto, Yuji Kobayashi:
A Finiteness Condition for Rewriting Systems. Theor. Comput. Sci. 131(2): 271-294 (1994) - 1993
- [j3]Masashi Katsura, Yuji Kobayashi:
The Shuffle Algebra and its Derivations. Theor. Comput. Sci. 115(2): 359-369 (1993)
1980 – 1989
- 1988
- [j2]Yuji Kobayashi:
Enumeration of irreducible binary words. Discret. Appl. Math. 20(3): 221-232 (1988) - 1986
- [j1]Yuji Kobayashi:
Repetition-Free Words. Theor. Comput. Sci. 44: 175-197 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
