Learning fallible deterministic finite automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193511 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A note on the number of queries needed to identify regular languages
- A theory of the learnable
- Cryptographic limitations on learning Boolean formulae and finite automata
- Efficient learning of typical finite automata from random walks
- Efficient noise-tolerant learning from statistical queries
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- Inference of finite automata using homing sequences
- Learning Integer Lattices
- Learning conjunctions of Horn clauses
- Learning in the Presence of Malicious Errors
- Learning read-once formulas with queries
- Learning regular sets from queries and counterexamples
- Occam's razor
- On Learning Ring-Sum-Expansions
- On learning from queries and counterexamples in the presence of noise
- Prediction-preserving reducibility
- Probability Inequalities for Sums of Bounded Random Variables
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Self-testing/correcting with applications to numerical problems
- The probabilistic method
Cited in
(7)- Learning automata with side-effects
- Learning with errors in answers to membership queries
- Recent advances of grammatical inference
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Grammatical inference: An old and new paradigm
- Learning the language of software errors
- Efficient learning of typical finite automata from random walks
This page was built for publication: Learning fallible deterministic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900974)
