Learning weighted automata
From MaRDI portal
Publication:2947142
Recommendations
Cites work
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3709587 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A spectral algorithm for learning hidden Markov models
- A theory of the learnable
- Biological Sequence Analysis
- Complexity of automaton identification from given data
- Cryptographic limitations on learning Boolean formulae and finite automata
- Formal Analysis of Online Algorithms
- Foundations of machine learning
- Handbook of weighted automata
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning functions represented as multiplicity automata
- Learning regular sets from queries and counterexamples
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Matrices de Hankel
- On Optimal Learning Algorithms for Multiplicity Automata
- On a Special Class of Recurrent Events
- On the Rademacher complexity of weighted automata
- On the complexity of minimum inference of regular sets
- On the definition of a family of automata
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Rational kernels: theory and algorithms
- Realizations by stochastic finite automata
- Spectral learning of weighted automata. A forward-backward perspective
- The Principal Axis Theorem Over Arbitrary Fields
- The minimum consistent DFA problem cannot be approximated within any polynomial
- Weighted automata algorithms
Cited in
(26)- Learning quantum finite automata with queries
- Learning infinite-word automata with loop-index queries
- Implementation and Application of Automata
- On the Rademacher complexity of weighted automata
- KI 2004: Advances in Artificial Intelligence
- Approximate learning of limit-average automata
- Regular \(\omega\)-languages with an informative right congruence
- Active learning for sound negotiations
- Weighted automata are compact and actively learnable
- Learning and characterizing fully-ordered lattice automata
- Algorithms for weighted finite automata with failure transitions
- Algorithms and training for weighted multiset automata and regular expressions
- Implementation and Application of Automata
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- scientific article; zbMATH DE number 6819790 (Why is no real title available?)
- A new approach for active automata learning based on apartness
- Inferring regular languages and \(\omega\)-languages
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Weighted finite automata with output
- Approximate minimization of weighted tree automata
- Bisimulation metrics and norms for real-weighted automata
- Orbit-finite-dimensional vector spaces and weighted register automata
- Learning weighted automata over principal ideal domains
- Generalization bounds for learning weighted automata
- Spectral learning of weighted automata. A forward-backward perspective
- scientific article; zbMATH DE number 7471718 (Why is no real title available?)
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)
