Sciweavers

493 search results - page 12 / 99
» Alternating Weighted Automata
Sort
View
DLT
2009
13 years 5 months ago
Weighted versus Probabilistic Logics
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...
Benedikt Bollig, Paul Gastin
ISCI
2010
110views more  ISCI 2010»
13 years 6 months ago
Weighted finite automata over strong bimonoids
: 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...
Manfred Droste, Torsten Stüber, Heiko Vogler
TALG
2010
101views more  TALG 2010»
13 years 5 months ago
Reasoning about online algorithms with weighted automata
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...
Benjamin Aminof, Orna Kupferman, Robby Lampert
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 7 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
IJFCS
2007
63views more  IJFCS 2007»
13 years 7 months ago
Path-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
Mathieu Giraud, Philippe Veber, Dominique Lavenier