MAT learners for tree series: an abstract data type and two realizations

DOI10.1007/S00236-011-0135-XzbMATH Open1251.68129OpenAlexW2162889972MaRDI QIDQ766165FDOQ766165

Authors: Frank Drewes, Johanna Högberg, Andreas Maletti 

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-30299

Recommendations

• scientific article; zbMATH DE number 5854939
• Learning Deterministically Recognizable Tree Series — Revisited
• Learning deterministically recognizable tree series
• Query learning of regular tree languages: How to avoid dead states
• MAT learning of universal automata

zbMATH Keywords

abstract data typelearning deterministic weighted tree automataminimal adequate teacher modelobservation trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Abstract data types; algebraic specification (68Q65)

Cites Work

• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Language identification in the limit
• A theory of the learnable
• Learning context-free grammars from structural data in polynomial time
• Query learning of regular tree languages: How to avoid dead states
• Title not available (Why is that?)
• Grammatical Inference: Algorithms and Applications
• Recognizable formal power series on trees
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Title not available (Why is that?)
• Implementation and Application of Automata
• Title not available (Why is that?)
• Learning deterministically recognizable tree series
• Learning Deterministically Recognizable Tree Series — Revisited
• Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
• Learning Multiplicity Tree Automata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• MAT learning of universal automata
• Learning Deterministically Recognizable Tree Series — Revisited
• Title not available (Why is that?)
• Learning Tree Languages
• Learning deterministically recognizable tree series
• On the regularity and learnability of ordered DAG languages
• Four one-shot learners for regular tree languages and their polynomial characterizability

This page was built for publication: MAT learners for tree series: an abstract data type and two realizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766165)