Learning fallible deterministic finite automata (Q1900974): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of queries needed to identify regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning conjunctions of Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning read-once formulas with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Learning Ring-Sum-Expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of typical finite automata from random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Integer Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning in the Presence of Malicious Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction-preserving reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of finite automata using homing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning from queries and counterexamples in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Latest revision as of 16:55, 23 May 2024

scientific article
Language Label Description Also known as
English
Learning fallible deterministic finite automata
scientific article

    Statements

    Learning fallible deterministic finite automata (English)
    0 references
    0 references
    0 references
    29 October 1995
    0 references
    deterministic finite automata
    0 references

    Identifiers