Complexity of Equivalence and Learning for Multiplicity Tree Automata

DOI10.1007/978-3-662-44522-8_35zbMath1425.68219arXiv1405.0514OpenAlexW144407630MaRDI QIDQ2922034

Ines Marusic, James Worrell

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0514

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Complexity of Equivalence and Learning for Multiplicity Tree Automata ⋮ Minimisation of Multiplicity Tree Automata

Cites Work

• Unnamed Item
• Handbook of weighted automata
• Queries and concept learning
• Complexity of Equivalence and Learning for Multiplicity Tree Automata
• Représentations matricielles des séries d'arbre reconnaissables
• Deciding Equivalence of Finite Tree Automata
• Learning Multiplicity Tree Automata
• On the Complexity of Numerical Analysis
• Learning functions represented as multiplicity automata
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• On Optimal Learning Algorithms for Multiplicity Automata
• Computational Complexity

This page was built for publication: Complexity of Equivalence and Learning for Multiplicity Tree Automata