1343 search results - page 6 / 269 » Learning Weighted Automata |
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
CAV
2012
Springer
12 years 7 days ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
RP
2009
Springer
14 years 4 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
ATVA
2011
Springer
12 years 9 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...