254 search results - page 24 / 51 » Restarting Tree Automata |
111
click to vote
RTA
2005
Springer
15 years 5 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
PODS
2004
ACM
15 years 12 months ago
2004
ACM
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
WIA
2007
Springer
15 years 6 months ago
2007
Springer
ATVA
2005
Springer
15 years 5 months ago
2005
Springer