On Optimal Learning Algorithms for Multiplicity Automata

DOI10.1007/11776420_16MaRDI QIDQ5307568zbMATH OpenOpenAlexFDO

Authors Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi

Publication date 14 September 2007

Published in Learning Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11776420_16

Mathematics Subject Classification ID

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

Recommendations

• Complexity of equivalence and learning for multiplicity tree automata
• Learning functions represented as multiplicity automata
• Complexity of equivalence and learning for multiplicity tree automata
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning Multiplicity Tree Automata

Cited in

(13)

• On the Complexity of Learning Minimum Time-Bounded Turing Machines
• Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
• Learning Multiplicity Tree Automata
• Complexity of equivalence and learning for multiplicity tree automata
• Complexity of equivalence and learning for multiplicity tree automata
• Learning functions represented as multiplicity automata
• Efficient learning of real time one-counter automata
• Learning weighted automata
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• On conditional optimality of a class of learning automata in random environments
• A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton
• Almost optimal proper learning and testing polynomials
• Generalization bounds for learning weighted automata

This page was built for publication: On Optimal Learning Algorithms for Multiplicity Automata

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