Decidability of Reachability for Term Rewriting with Reduction Strategies
名古屋大学博士学位論文 学位の種類 : 博士(情報科学)(課程) 学位授与年月日:平成24年3月26日
Main Authors: | 小島, 芳治, Kojima, Yoshiharu |
---|---|
Language: | en |
Published: |
2012
|
Online Access: | http://hdl.handle.net/2237/17961 |
Similar Items
-
Reachability games with counters : decidability and algorithms
by: Reichert, Julien
Published: (2015) -
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
by: UCHIYAMA, Keita, et al.
Published: (2007) -
Deciding Reachability for 3-Dimensional Multi-Linear Systems
by: Olga Tveretina, et al.
Published: (2011-06-01) -
Verification of networks of communicating processes : Reachability problems and decidability issues
by: Rezine, Othmane
Published: (2017) -
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
by: Uchiyama, Keita, et al.
Published: (2007)