Learning Deterministic Finite Automata from Smallest Counterexamples (Q2706180)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Learning Deterministic Finite Automata from Smallest Counterexamples
scientific article

    Statements

    Learning Deterministic Finite Automata from Smallest Counterexamples (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2001
    0 references
    learning from smallest counterexamples
    0 references
    self-directed learning
    0 references
    deterministic finite automata
    0 references
    multiplicity automata
    0 references

    Identifiers