Polynomial-time inference of arbitrary pattern languages (Q749229): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of inductive inference from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in the theory of inductive inference by GDR mathematicians - A survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:14, 21 June 2024

scientific article
Language Label Description Also known as
English
Polynomial-time inference of arbitrary pattern languages
scientific article

    Statements

    Polynomial-time inference of arbitrary pattern languages (English)
    0 references
    0 references
    0 references
    1991
    0 references
    machine learning
    0 references
    inductive inference
    0 references
    polynomial-time complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references