31 search results - page 1 / 7 » On the Confluence of Trace Rewriting Systems |
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
In [NO88], a particular trace monoid M is constructed such that for the class of length
ENTCS
2008
13 years 6 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...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
LPAR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
AISC
2006
Springer
13 years 10 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...