Learning fallible deterministic finite automata
type: Item
instance of: scholarly article
title: Learning fallible deterministic finite automata
zbMATH Open document ID: 0831.68088
DOI: 10.1007/BF00993409
author: Dana Ron
author: Ronitt Rubinfeld
published in: Machine Learning
publication date: 1995-10-29T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 810129
zbMATH Keywords: deterministic finite automata
MaRDI profile type: Publication
cites work: The probabilistic method
cites work: A note on the number of queries needed to identify regular languages
cites work: Learning regular sets from queries and counterexamples
cites work: Learning conjunctions of Horn clauses
cites work: Learning read-once formulas with queries
cites work: Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
cites work: Self-testing/correcting with applications to numerical problems
cites work: Occam's razor
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: On Learning Ring-Sum-Expansions
cites work: Efficient learning of typical finite automata from random walks
cites work: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
cites work: Learning Integer Lattices
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q5551191
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Learning in the Presence of Malicious Errors
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Q4040311
cites work: Prediction-preserving reducibility
cites work: Inference of finite automata using homing sequences
cites work: On learning from queries and counterexamples in the presence of noise
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 810129