A simple algorithm for learning O(log n)-term DNF (Q1392215): 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: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of finite automata using homing sequences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:23, 28 May 2024

scientific article
Language Label Description Also known as
English
A simple algorithm for learning O(log n)-term DNF
scientific article

    Statements

    A simple algorithm for learning O(log n)-term DNF (English)
    0 references
    0 references
    23 July 1998
    0 references
    Exact learning
    0 references
    DNF
    0 references
    Deterministic automata
    0 references

    Identifiers