Learning indexed families of recursive languages from positive data: A survey (Q924177): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.02.030 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4471977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible 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: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis of language learners. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of automata, functions and programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing learners tolerating computable noisy data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental concept learning for bounded data mining. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing noise-tolerant language learners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244304773936063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic sets for polynomial grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results on grammatical inference and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of inductive inference from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of models for polynomial learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning languages and functions by erasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language learning from texts: Degrees of intrinsic complexity and their characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability of recursively enumerable languages from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Better Understanding of Incremental Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization and specialization strategies for learning r. e. languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language learning from texts: Mindchanges, limited memory and monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of iterative learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning recursive languages from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of arbitrary pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-driven and rearrangement-independent learning of recursive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic and dual monotonic language learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal language identification: query learning vs. gold-style learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between Gold-style learning and query learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning erasing pattern languages with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments from enquiries into the learnability of the pattern languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4420758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-learnable class of E-pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discontinuities in pattern inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: An average-case optimal one-variable pattern language learner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic finite learning of the pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances of grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rich classes inferable from positive data: Length-bounded elementary formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noisy inference and oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignoring data may be the only way to learn efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time identification of very simple grammars from positive data. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Efficiency of Very Simple Grammars from Positive Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time / rank
 
Normal rank
Property / cites work
 
Property / cites work: From learning in the limit to stochastic finite learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning recursive functions: A survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.02.030 / rank
 
Normal rank

Latest revision as of 08:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Learning indexed families of recursive languages from positive data: A survey
scientific article

    Statements

    Learning indexed families of recursive languages from positive data: A survey (English)
    0 references
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    inductive inference
    0 references
    formal languages
    0 references
    recursion theory
    0 references
    query learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers