Learning two-tape automata from queries and counterexamples (Q4879209)

From MaRDI portal
Revision as of 12:23, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 881753
Language Label Description Also known as
English
Learning two-tape automata from queries and counterexamples
scientific article; zbMATH DE number 881753

    Statements

    Learning two-tape automata from queries and counterexamples (English)
    0 references
    0 references
    0 references
    27 May 1996
    0 references
    0 references
    learning problem
    0 references
    deterministic finite automata
    0 references
    0 references