CLASSES WHOSE TERMINATION IS DECIDABLE
Main Author: | Sakai, Masahiko |
---|---|
Language: | en |
Published: |
INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE
2006
|
Online Access: | http://hdl.handle.net/2237/10414 |
Similar Items
-
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
by: Uchiyama, Keita, et al.
Published: (2007) -
Decidability of Termination for Semi-Constructor TRSs, Left-Linear Shallow TRSs and Related Systems
by: Wang, Yi, et al.
Published: (2006) -
Decidability of Termination Left-Linear Shallow TRSs and Related Systems for Semi-Constructor TRSs
by: Yi, Wang, et al.
Published: (2006) -
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
by: UCHIYAMA, Keita, et al.
Published: (2007) -
Decidable classes of recursive equations
by: Lee, R. D.
Published: (1969)