Learning weighted automata
From MaRDI portal
Publication:2947142
DOI10.1007/978-3-319-23021-4_1zbMATH Open1401.68144OpenAlexW2295721640MaRDI QIDQ2947142FDOQ2947142
Authors: Borja Balle, Mehryar Mohri 
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
Recommendations
Formal languages and automata (68Q45) Computational learning theory (68Q32) Algebraic theory of languages and automata (68Q70)
Cites Work
- Biological Sequence Analysis
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Handbook of weighted automata
- Title not available (Why is that?)
- A theory of the learnable
- Matrices de Hankel
- On the definition of a family of automata
- Title not available (Why is that?)
- Foundations of machine learning
- Title not available (Why is that?)
- Complexity of automaton identification from given data
- On the complexity of minimum inference of regular sets
- Cryptographic limitations on learning Boolean formulae and finite automata
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Realizations by stochastic finite automata
- A spectral algorithm for learning hidden Markov models
- Weighted automata algorithms
- Learning functions represented as multiplicity automata
- Spectral learning of weighted automata. A forward-backward perspective
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- The minimum consistent DFA problem cannot be approximated within any polynomial
- On a Special Class of Recurrent Events
- On Optimal Learning Algorithms for Multiplicity Automata
- Rational kernels: theory and algorithms
- The Principal Axis Theorem Over Arbitrary Fields
- On the Rademacher complexity of weighted automata
- Formal Analysis of Online Algorithms
- Minimisation of multiplicity tree automata
- Title not available (Why is that?)
Cited In (26)
- Implementation and Application of Automata
- Orbit-finite-dimensional vector spaces and weighted register automata
- Learning quantum finite automata with queries
- Algorithms for weighted finite automata with failure transitions
- Algorithms and training for weighted multiset automata and regular expressions
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Learning and characterizing fully-ordered lattice automata
- Regular \(\omega\)-languages with an informative right congruence
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- Spectral learning of weighted automata. A forward-backward perspective
- Weighted finite automata with output
- Title not available (Why is that?)
- Active learning for sound negotiations
- Approximate minimization of weighted tree automata
- Bisimulation metrics and norms for real-weighted automata
- Title not available (Why is that?)
- Implementation and Application of Automata
- Title not available (Why is that?)
- Generalization bounds for learning weighted automata
- A new approach for active automata learning based on apartness
- Inferring regular languages and \(\omega\)-languages
- On the Rademacher complexity of weighted automata
- Weighted automata are compact and actively learnable
- KI 2004: Advances in Artificial Intelligence
- Learning weighted automata over principal ideal domains
This page was built for publication: Learning weighted automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947142)
