493 search results - page 41 / 99 » Alternating Weighted Automata |
133
click to vote
ASE
2002
15 years 2 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
119
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
124
click to vote
GLVLSI
1999
IEEE
15 years 7 months ago
1999
IEEE
Despite the seemingly endless upwards spiral of modern VLSI technology, many experts are predicting a hard wall for CMOS in about a decade. Given this, researchers continue to loo...
133
click to vote
LICS
2010
IEEE
15 years 29 days ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
120
click to vote
CAV
1999
Springer
15 years 7 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...