Sciweavers

    ALT
    2005
    Springer
    128views Machine Learning» more  ALT 2005»
    PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
    14 years 8 months ago
    PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
    Download  www.csc.liv.ac.uk
    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
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.