Learning fallible deterministic finite automata
From MaRDI portal
Publication:1900974
DOI10.1007/BF00993409zbMATH Open0831.68088MaRDI QIDQ1900974FDOQ1900974
Authors: Dana Ron, Ronitt Rubinfeld 
Publication date: 29 October 1995
Published in: Machine Learning (Search for Journal in Brave)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Learning regular sets from queries and counterexamples
- Learning conjunctions of Horn clauses
- Learning read-once formulas with queries
- Self-testing/correcting with applications to numerical problems
- The probabilistic method
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- Occam's razor
- Learning in the Presence of Malicious Errors
- Cryptographic limitations on learning Boolean formulae and finite automata
- A note on the number of queries needed to identify regular languages
- Inference of finite automata using homing sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Learning Ring-Sum-Expansions
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Efficient learning of typical finite automata from random walks
- Prediction-preserving reducibility
- On learning from queries and counterexamples in the presence of noise
- Learning Integer Lattices
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
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)
