Learning two-tape automata from queries and counterexamples (Q4879209): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:51, 8 February 2024

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