41 search results - page 1 / 9 » Algorithms for weighted multi-tape automata |
TALG
2010
13 years 3 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
ATVA
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
DLT
2009
13 years 2 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...