Learning commutative deterministic finite state automata in polynomial time (Q749224): 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: Q4013524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction-preserving reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 21 June 2024

scientific article
Language Label Description Also known as
English
Learning commutative deterministic finite state automata in polynomial time
scientific article

    Statements

    Learning commutative deterministic finite state automata in polynomial time (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    computational learning theory
    0 references
    machine learning
    0 references
    mistake bound model
    0 references
    PAC learning model
    0 references
    commutative DFA
    0 references