2467 search results - page 222 / 494 » Finite State Machines |
179
click to vote
ALT
2005
Springer
16 years 3 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
155
click to vote
PTS
2007
15 years 8 months ago
2007
Abstract. We investigate the use of parameterized state machine models to drive integration testing, in the case where the models of components are not available beforehand. Theref...
177
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
189
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
160
click to vote
LREC
2008
15 years 8 months ago
2008
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...