1343 search results - page 19 / 269 » Learning Weighted Automata |
113
Voted
ALT
2009
Springer
16 years 10 days ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
131
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
159
Voted
FOSSACS
2012
Springer
13 years 11 months ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
112
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
126
Voted
DBSEC
2010
15 years 4 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...