scientific article; zbMATH DE number 3584924

MaRDI QIDQ4154072zbMATH OpenFDO

Authors Rolf Wiehagen

Publication date 1977

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited in

(11)

• Learning in the presence of partial explanations
• Learning indexed families of recursive languages from positive data: A survey
• Monotonic and dual monotonic language learning
• Aspects of complexity of probabilistic learning under monotonicity constraints
• On the learnability of vector spaces
• Learning by switching type of information.
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Synthesizing learners tolerating computable noisy data
• Probabilistic language learning under monotonicity constraints
• Inductive inference of recursive functions: qualitative theory
• Identification of function distinguishable languages.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154072)