Learning Behaviors of Automata from Multiplicity and Equivalence Queries
From MaRDI portal
Recommendations
- On Optimal Learning Algorithms for Multiplicity Automata
- scientific article; zbMATH DE number 1008506
- Learning Multiplicity Tree Automata
- Complexity of equivalence and learning for multiplicity tree automata
- Complexity of equivalence and learning for multiplicity tree automata
- scientific article; zbMATH DE number 1281920
- scientific article; zbMATH DE number 1301788
- Learning functions represented as multiplicity automata
- Learning finite cover automata from queries
- A generic algorithm for learning symbolic automata from membership queries
Cited in
(37)- A simple algorithm for learning O(log n)-term DNF
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Inferring regular languages and \(\omega\)-languages
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Regular \(\omega\)-languages with an informative right congruence
- A categorical framework for learning generalised tree automata
- Learning weighted automata over principal ideal domains
- Stefano Varricchio (1960-2008)
- Learning expressions and programs over monoids
- Complexity of equivalence and learning for multiplicity tree automata
- Complexity of equivalence and learning for multiplicity tree automata
- Learning weighted automata
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
- Learning finite automata using label queries
- An Algebraic Perspective on Boolean Function Learning
- scientific article; zbMATH DE number 1301788 (Why is no real title available?)
- Learning functions represented as multiplicity automata
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- Residuality and learning for nondeterministic nominal automata
- A generic algorithm for learning symbolic automata from membership queries
- On Optimal Learning Algorithms for Multiplicity Automata
- Learning of Structurally Unambiguous Probabilistic Grammars
- Almost optimal proper learning and testing polynomials
- Inferring Symbolic Automata
- Representing regular languages of infinite words using mod 2 multiplicity automata
- Learning quantum finite automata with queries
- A new approach for active automata learning based on apartness
- L^*-based learning of Markov decision processes
- Learning automata and transducers: a categorical approach
- Active learning of deterministic transducers with outputs in arbitrary monoids
- Active learning of deterministic transducers with outputs in arbitrary monoids
- Unsupervised automata learning via discrete optimization
- Complete test suites for automata in monoidal closed categories
- Feasability of learning weighted automata on a semiring
- Learning closed signal flow graphs
- Learning bottom-up tree automata valued in monoidal categories
This page was built for publication: Learning Behaviors of Automata from Multiplicity and Equivalence Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691294)
