記事
Icons representing pdf

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems

Material type
記事
Author
Kojima, Yoshiharuほか
Publisher
Springer
Publication date
2008
Material Format
Digital
Journal name
Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117
Publication Page
p.187-201
View All

Notes on use

Note (General):

19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008 Proceedings

Detailed bibliographic record

Summary, etc.:

A reachability problem is a problem used to decide whether s is reachable to t by R or not for a given two terms s, t and a term rewriting system R. S...

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • NAGOYA Repository

    Digital
    You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type
記事
Author/Editor
Kojima, Yoshiharu
Sakai, Masahiko
Publication, Distribution, etc.
Publication Date
2008
Publication Date (W3CDTF)
2008
Periodical title
Rewriting Techniques and Applications, Lecture Notes in Computer Science
No. or year of volume/issue
5117
Volume
5117