Learning Deterministically Recognizable Tree Series — Revisited

DOI10.1007/978-3-540-75414-5_14zbMath1148.68390OpenAlexW1503561194MaRDI QIDQ3522869

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)

Related Items (5)

On the regularity and learnability of ordered DAG languages ⋮ Tree-Based Generation of Restricted Graph Languages ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ Minimizing deterministic weighted tree automata

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