4985 search results - page 2 / 997 » Observation of String-Rewriting Systems |
TCS
1998
13 years 5 months ago
1998
AAECC
2008
Springer
13 years 5 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...
STACS
2007
Springer
13 years 11 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...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
JSC
2007
13 years 5 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...