Learning fallible deterministic finite automata
From MaRDI portal
Publication:1900974
DOI10.1007/BF00993409zbMath0831.68088MaRDI QIDQ1900974
Publication date: 29 October 1995
Published in: Machine Learning (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (4)
Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Learning with errors in answers to membership queries ⋮ Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On learning from queries and counterexamples in the presence of noise
- Prediction-preserving reducibility
- Learning regular sets from queries and counterexamples
- Occam's razor
- Learning conjunctions of Horn clauses
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Self-testing/correcting with applications to numerical problems
- Inference of finite automata using homing sequences
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- Learning in the Presence of Malicious Errors
- A theory of the learnable
- On Learning Ring-Sum-Expansions
- Learning Integer Lattices
- Learning read-once formulas with queries
- Cryptographic limitations on learning Boolean formulae and finite automata
- A note on the number of queries needed to identify regular languages
- Efficient learning of typical finite automata from random walks
- Efficient noise-tolerant learning from statistical queries
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Learning fallible deterministic finite automata
