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

DOI10.1007/S00236-011-0135-XMaRDI QIDQ766165zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 5854939 (Why is no real title available?)
• Learning Deterministically Recognizable Tree Series — Revisited
• On the regularity and learnability of ordered DAG languages
• Four one-shot learners for regular tree languages and their polynomial characterizability
• Learning Tree Languages
• Learning deterministically recognizable tree series
• MAT learning of universal automata

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)