Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Yoshiharu Kojima"'
Autor:
Yoshiharu Kojima
Publikováno v:
Han-Character and Classical written language Education. 28:489-507
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e767cd93d819756a515aa4365a109b4b
https://doi.org/10.15670/hace.2012.28.1.489
https://doi.org/10.15670/hace.2012.28.1.489
Autor:
Yoshiharu Kojima
Publikováno v:
Han-Character and Classical written language Education. 26:139-155
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e84af197b0cdb4ab6ab4c9c8857dc1b
https://doi.org/10.15670/hace.2011.26.1.139
https://doi.org/10.15670/hace.2011.26.1.139
Publikováno v:
IPSJ Online Transactions. 4:193-216
The reachability problem for an initial term, a goal term, and a rewrite system is to decide whether the initial term is reachable to goal one by the rewrite system or not. The innermost reachability problem is to decide whether the initial term is r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59d20e347664ab1975f462a220c00c8b
https://doi.org/10.2197/ipsjtrans.4.193
https://doi.org/10.2197/ipsjtrans.4.193
Publikováno v:
情報処理学会論文誌, プログラミング. 2(3):20-32
The reachability problem for given an initial term, a goal term, and a term rewriting system (TRS) is to decide whether the initial one is reachable to the goal one by the TRS or not. A term is shallow if each variable in the term occurs at depth 0 o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb3170a274a02ad6c78dd26b4fc33196
https://nagoya.repo.nii.ac.jp/records/19058
https://nagoya.repo.nii.ac.jp/records/19058
Publikováno v:
Automated Deduction-CADE-25 ISBN: 9783319214009
CADE
25th International Conference on Automated Deduction (CADE’15)
25th International Conference on Automated Deduction (CADE’15), Aug 2015, Berlin, Germany
CADE
25th International Conference on Automated Deduction (CADE’15)
25th International Conference on Automated Deduction (CADE’15), Aug 2015, Berlin, Germany
International audience; We consider the extension of term rewriting rules with context constraints restricting the application of rewriting to positions whose prefix (i.e. the sequence of symbols from the rewrite position up to the root) belongs to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdd7c4df81fb6751a0b4bfac1ecaaf75
https://doi.org/10.1007/978-3-319-21401-6_9
https://doi.org/10.1007/978-3-319-21401-6_9
Publikováno v:
Japanese Journal of Ophthalmology. 45:640-647
Purpose: To understand the pathophysiology of central serous chorioretinopathy or bullous retinal detachment in patients under systemic corticosteroid treatment. Little is understood about the mechanism of the development of serous retinal detachment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a38931059598abfa8aa4d79a1c84ebb7
https://doi.org/10.1016/s0021-5155(01)00428-2
https://doi.org/10.1016/s0021-5155(01)00428-2
Publikováno v:
8th International Symposium Frontiers of Combining Systems (FroCoS 2011)
8th International Symposium Frontiers of Combining Systems (FroCoS 2011), Oct 2011, Saarbrücken, Germany. pp.179-194
Frontiers of Combining Systems ISBN: 9783642243639
FroCoS
8th International Symposium Frontiers of Combining Systems (FroCoS 2011), Oct 2011, Saarbrücken, Germany. pp.179-194
Frontiers of Combining Systems ISBN: 9783642243639
FroCoS
International audience; Motivated by the problem of verification of imperative tree transformation programs, we study the combination, called controlled term rewriting systems (CntTRS), of term rewriting rules with con- straints selecting the possibl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6139bbe31b7bd9207eff0bd0f9455efb
https://inria.hal.science/hal-00643160/document
https://inria.hal.science/hal-00643160/document
Autor:
Yoshiharu Kojima, Masahiko Sakai
Publikováno v:
Rewriting Techniques and Applications ISBN: 9783540705888
RTA
RTA
A reachability problem is a problem used to decide whether s is reachable to tby Ror not for a given two terms s, tand a term rewriting system R. Since it is known that this problem is undecidable, effort has been devoted to finding subclasses of ter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33c2a66cf1aab50efb870cc09d9007f1
https://doi.org/10.1007/978-3-540-70590-1_13
https://doi.org/10.1007/978-3-540-70590-1_13
Autor:
Katsura Kojima, Yoshiharu Kojima
Publikováno v:
Journal of the Yamashina Institute for Ornithology. 37:1-2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca35b62113047969df94161370f3499c
https://doi.org/10.3312/jyio.37.1
https://doi.org/10.3312/jyio.37.1
Autor:
Yoshinori Yonekura, Akihito Minami, Hiroyuki Maezawa, Yoshiharu Kojima, Atsushi Nishimura, Kazuhito Dobashi, Taku Nakajima, Hideo Ogawa, Tomomi Shimoikura, Kimihiro Kimura, Shin'ichiro Asayama, Yuya Ota, Yasuhiro Abe, Masahiro Kaiden, Takashi Noguchi, Kazuyuki Muraoka, Toshihiro Handa, Shiori Touga, Nario Kuno, Toshikazu Onishi, Kazuki Tokuda, Akio Hashizume
Publikováno v:
Publications of the Astronomical Society of Japan. 65:78
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10c27a8986c4e9fab16bed707eb83e67
https://doi.org/10.1093/pasj/65.4.78
https://doi.org/10.1093/pasj/65.4.78