MAT learners for tree series: an abstract data type and two realizations
From MaRDI portal
Publication:766165
DOI10.1007/s00236-011-0135-xzbMath1251.68129OpenAlexW2162889972MaRDI QIDQ766165
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
abstract data typelearning deterministic weighted tree automataminimal adequate teacher modelobservation trees
Computational learning theory (68Q32) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)
Related Items (3)
On the regularity and learnability of ordered DAG languages ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Learning Tree Languages
Cites Work
- Query learning of regular tree languages: How to avoid dead states
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Recognizable formal power series on trees
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- Learning Deterministically Recognizable Tree Series — Revisited
- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
- Learning Multiplicity Tree Automata
- A theory of the learnable
- Implementation and Application of Automata
- Grammatical Inference: Algorithms and Applications
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: MAT learners for tree series: an abstract data type and two realizations
