18 search results - page 4 / 4 » Weighted Automata for Proving Termination of String Rewritin... |
FORMATS
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
CADE
2008
Springer
14 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
TCS
2008
13 years 8 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...