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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q124969694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular prefix relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets recognized by n-tape automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of sequential relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine realization of the linear context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical inference for even linear languages based on control sets / rank
 
Normal rank

Latest revision as of 12:23, 24 May 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
    0 references