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

From MaRDI portal
Revision as of 07:06, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q124969694, #quickstatements; #temporary_batch_1712286835472)
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