13 search results - page 1 / 3 » Undecidable Properties on Length-Two String Rewriting System... |
ENTCS
2008
13 years 11 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...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
RTA
1993
Springer
14 years 3 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...