Ordered term tree languages which are polynomial time inductively inferable from positive data (Q817835)

From MaRDI portal
Revision as of 11:07, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)





scientific article
Language Label Description Also known as
English
Ordered term tree languages which are polynomial time inductively inferable from positive data
scientific article

    Statements

    Ordered term tree languages which are polynomial time inductively inferable from positive data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    machine learning
    0 references
    inductive inference
    0 references
    tree structured pattern
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers