MAT learners for tree series: an abstract data type and two realizations (Q766165): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-011-0135-x / 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: Q4473537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable formal power series on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: L<sub>p</sub> DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query learning of regular tree languages: How to avoid dead states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Multiplicity Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Deterministically Recognizable Tree Series — Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning context-free grammars from structural data in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00236-011-0135-X / rank
 
Normal rank

Latest revision as of 03:15, 10 December 2024

scientific article
Language Label Description Also known as
English
MAT learners for tree series: an abstract data type and two realizations
scientific article

    Statements

    MAT learners for tree series: an abstract data type and two realizations (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2012
    0 references
    minimal adequate teacher model
    0 references
    learning deterministic weighted tree automata
    0 references
    abstract data type
    0 references
    observation trees
    0 references

    Identifiers