Sciweavers

2 search results - page 1 / 1
» PAC-Learnability of Probabilistic Deterministic Finite State...
Sort
View
ALT
2005
Springer
14 years 1 months ago
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
Nick Palmer, Paul W. Goldberg
TCIAIG
2010
12 years 11 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang