7 search results - page 2 / 2 » Equational approximations for tree automata completion |
CADE
2009
Springer
14 years 6 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...