Learning Weighted Automata

DOI10.1007/978-3-319-23021-4_1zbMath1401.68144OpenAlexW2295721640MaRDI QIDQ2947142

Mehryar Mohri, Borja Balle

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_1

Mathematics Subject Classification ID

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

Related Items (14)

Learning infinite-word automata with loop-index queries ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Learning quantum finite automata with queries ⋮ Learning and characterizing fully-ordered lattice automata ⋮ Unnamed Item ⋮ The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete ⋮ Learning weighted automata over principal ideal domains ⋮ Generalization bounds for learning weighted automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Approximate minimization of weighted tree automata ⋮ On the Rademacher Complexity of Weighted Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral algorithm for learning hidden Markov models
• Spectral learning of weighted automata. A forward-backward perspective
• Handbook of weighted automata
• Learning regular sets from queries and counterexamples
• Matrices de Hankel
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Realizations by stochastic finite automata
• On the Rademacher Complexity of Weighted Automata
• Minimisation of Multiplicity Tree Automata
• Formal Analysis of Online Algorithms
• On the definition of a family of automata
• A theory of the learnable
• The minimum consistent DFA problem cannot be approximated within any polynomial
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Biological Sequence Analysis
• The Principal Axis Theorem Over Arbitrary Fields
• Cryptographic limitations on learning Boolean formulae and finite automata
• Learning functions represented as multiplicity automata
• Weighted Automata Algorithms
• On Optimal Learning Algorithms for Multiplicity Automata
• On a Special Class of Recurrent Events
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries

This page was built for publication: Learning Weighted Automata