The complexity of learning SUBSEQ(<i>A</i>) (Q3399186)

From MaRDI portal
Revision as of 22:00, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of learning SUBSEQ(<i>A</i>)
scientific article

    Statements

    The complexity of learning SUBSEQ(<i>A</i>) (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2009
    0 references
    formal languages
    0 references
    machine learning
    0 references
    inductive inference
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references