Learning Deterministically Recognizable Tree Series — Revisited

DOI10.1007/978-3-540-75414-5_14MaRDI QIDQ3522869zbMATH OpenOpenAlexFDO

Authors Andreas Maletti

Publication date 4 September 2008

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75414-5_14

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning deterministically recognizable tree series
• scientific article; zbMATH DE number 5854939
• MAT learners for tree series: an abstract data type and two realizations
• Query learning of regular tree languages: How to avoid dead states
• scientific article; zbMATH DE number 2040913

Cited in

(10)

• Minimizing deterministic weighted tree automata
• Learning weighted automata over principal ideal domains
• On the regularity and learnability of ordered DAG 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 deterministically recognizable tree series
• Minimizing Deterministic Weighted Tree Automata
• Tree-Based Generation of Restricted Graph Languages
• Learning closed signal flow graphs
• MAT learners for tree series: an abstract data type and two realizations

This page was built for publication: Learning Deterministically Recognizable Tree Series — Revisited

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