Learning commutative deterministic finite state automata in polynomial time (Q749224)

From MaRDI portal
Revision as of 12:14, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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