Learning deterministically recognizable tree series

DOI10.25596/JALC-2007-333MaRDI QIDQ3517256zbMATH OpenFDO

Authors Frank Drewes, Heiko Vogler

Publication date 12 August 2008

Full work available at URL https://doi.org/10.25596/JALC-2007-333

zbMATH Keywords

algorithmic learningweighted tree automaton

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Learning Deterministically Recognizable Tree Series — Revisited
• scientific article; zbMATH DE number 5854939
• A Medvedev characterization of recognizable tree series
• Query learning of regular tree languages: How to avoid dead states
• MAT learners for tree series: an abstract data type and two realizations

Cited in

(12)

• Minimizing deterministic weighted tree automata
• Learning algorithms
• On the regularity and learnability of ordered DAG languages
• Learning Tree Languages
• scientific article; zbMATH DE number 5854939 (Why is no real title available?)
• scientific article; zbMATH DE number 5854945 (Why is no real title available?)
• Learning Rational Stochastic Tree Languages
• Learning Deterministically Recognizable Tree Series — Revisited
• Minimizing Deterministic Weighted Tree Automata
• Myhill-Nerode Theorem for Recognizable Tree Series Revisited
• Tree-Based Generation of Restricted Graph Languages
• MAT learners for tree series: an abstract data type and two realizations

This page was built for publication: Learning deterministically recognizable tree series

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