18 search results - page 3 / 4 » Weighted Automata for Proving Termination of String Rewritin... |
ISCI
2010
13 years 4 months ago
2010
: We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need t...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
LICS
2009
IEEE
14 years 21 days ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
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...