3169 search results - page 308 / 634 » Robust Timed Automata |
171
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
146
click to vote
TCS
2002
15 years 6 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
223
click to vote
TC
2010
15 years 1 months ago
2010
Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distr...
153
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
169
click to vote
ATS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...