209 search results - page 2 / 42 » Termination of Priority Rewriting |
ENTCS
2008
13 years 7 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
LPAR
2005
Springer
14 years 12 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
ENTCS
2008
13 years 7 months ago
2008
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
FROCOS
2011
Springer
12 years 6 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
RTA
2005
Springer
14 years 11 days ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...