Learning Multiplicity Tree Automata

DOI10.1007/11872436_22zbMath1158.68407OpenAlexW1626880919MaRDI QIDQ3541869

Jose Oncina, Amaury Habrard

Publication date: 27 November 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11872436_22

zbMATH Keywords

recognizable tree seriesmultiplicity tree automatalearning from equivalence and membership queries

Mathematics Subject Classification ID

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

Related Items (10)

Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Learning infinite-word automata with loop-index queries ⋮ Definable transductions and weighted logics for texts ⋮ Complexity of Equivalence and Learning for Multiplicity Tree Automata ⋮ Minimisation of Multiplicity Tree Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 Multiplicity Tree Automata