Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418)

From MaRDI portal
Revision as of 17:21, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
scientific article

    Statements

    Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (English)
    0 references
    0 references
    0 references
    16 October 2008
    0 references
    learning via queries
    0 references
    linear language
    0 references
    PAC learning
    0 references
    representative sample
    0 references

    Identifiers