Learning Multiplicity Tree Automata

DOI10.1007/11872436_22MaRDI QIDQ3541869zbMATH OpenOpenAlexFDO

Authors Amaury Habrard, Jose Oncina

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

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

Recommendations

• Complexity of equivalence and learning for multiplicity tree automata
• Complexity of equivalence and learning for multiplicity tree automata
• Learning functions represented as multiplicity automata
• On Optimal Learning Algorithms for Multiplicity Automata
• Learning Rational Stochastic Tree Languages

Cited in

(19)

• MAT learners for tree series: an abstract data type and two realizations
• Approximate learning of limit-average automata
• scientific article; zbMATH DE number 2019599 (Why is no real title available?)
• Inference of tree automata from sample set of trees
• Learning closed signal flow graphs
• Definable transductions and weighted logics for texts
• Multitree automata that count
• Minimizing Deterministic Weighted Tree Automata
• Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
• Learning infinite-word automata with loop-index queries
• Complexity of equivalence and learning for multiplicity tree automata
• Complexity of equivalence and learning for multiplicity tree automata
• Learning functions represented as multiplicity automata
• scientific article; zbMATH DE number 5854939 (Why is no real title available?)
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Minimizing deterministic weighted tree automata
• scientific article; zbMATH DE number 7649889 (Why is no real title available?)
• On Optimal Learning Algorithms for Multiplicity Automata
• Learning of Structurally Unambiguous Probabilistic Grammars

This page was built for publication: Learning Multiplicity Tree Automata

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