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

From MaRDI portal

Revision as of 08:15, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Learning indexed families of recursive languages from positive data: A survey (English)

0 references

0 references

Thomas Zeugmann

0 references

0 references

Theoretical Computer Science

0 references

publication date

28 May 2008

0 references

zbMATH Keywords

inductive inference

0 references

formal languages

0 references

recursion theory

0 references

query learning

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2008.02.030

0 references

0 references

Finding patterns common to a set of strings

0 references

Inductive inference of formal languages from positive data

0 references

Inference of Reversible Languages

0 references

Learning regular sets from queries and counterexamples

0 references

Queries and concept learning

0 references

Queries revisited.

0 references

The synthesis of language learners.

0 references

0 references

Inductive inference of automata, functions and programs

0 references

0 references

0 references

0 references

Toward a mathematical theory of inductive inference

0 references

A Machine-Independent Theory of the Complexity of Recursive Functions

0 references

Synthesizing learners tolerating computable noisy data

0 references

Incremental concept learning for bounded data mining.

0 references

Synthesizing noise-tolerant language learners

0 references

0 references

10.1162/153244304773936063

0 references

Algorithmic Learning Theory

0 references

On the complexity of inductive inference

0 references

Characteristic sets for polynomial grammatical inference

0 references

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

0 references

Some decidability results on grammatical inference and complexity

0 references

On the power of inductive inference from good examples

0 references

Limiting recursion

0 references

Language identification in the limit

0 references

Equivalence of models for polynomial learnability

0 references

0 references

Learning languages and functions by erasing

0 references

Language learning from texts: Degrees of intrinsic complexity and their characterizations

0 references

On the learnability of recursively enumerable languages from good examples

0 references

Towards a Better Understanding of Incremental Learning

0 references

Generalization and specialization strategies for learning r. e. languages

0 references

0 references

Language learning from texts: Mindchanges, limited memory and monotonicity

0 references

0 references

Variants of iterative learning

0 references

Learning recursive languages from good examples

0 references

Polynomial-time inference of arbitrary pattern languages

0 references

Incremental learning from positive data

0 references

Set-driven and rearrangement-independent learning of recursive languages

0 references

Monotonic and dual monotonic language learning

0 references

Algorithmic Learning Theory

0 references

Formal language identification: query learning vs. gold-style learning

0 references

Learning Theory

0 references

Relations between Gold-style learning and query learning

0 references

0 references

Learning erasing pattern languages with queries

0 references

Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses

0 references

Developments from enquiries into the learnability of the pattern languages from positive data

0 references

Classical recursion theory. Vol. II

0 references

Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings

0 references

0 references

Learning Theory

0 references

A non-learnable class of E-pattern languages

0 references

Discontinuities in pattern inference

0 references

An average-case optimal one-variable pattern language learner

0 references

Stochastic finite learning of the pattern languages

0 references

Recent advances of grammatical inference

0 references

0 references

0 references

Rich classes inferable from positive data: Length-bounded elementary formal systems

0 references

Noisy inference and oracles

0 references

0 references

A theory of the learnable

0 references

0 references

0 references

0 references

0 references

Ignoring data may be the only way to learn efficiently

0 references

0 references

Polynomial-time identification of very simple grammars from positive data.

0 references

Learning Efficiency of Very Simple Grammars from Positive Data

0 references

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

0 references

From learning in the limit to stochastic finite learning

0 references

Learning recursive functions: A survey

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2008.02.030

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:924177

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q924177&oldid=38534197"