Learning languages in a union

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Journal of computer and system sciences (Print)

• Publication date

  2001-11-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.jcss.2006.01.005
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Klein Lecture Comparative Economic Development : Insights from Uni ed Growth Theory

  2009cited by this paper
• On learning unions of pattern languages and tree patterns in the mistake bound model

  2002cited by this paper
• Intrinsic complexity of learning geometrical concepts from positive data

  2001cited by this paper
• Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations

  2000cited by this paper
• On Learning Unions of Pattern Languages and Tree Patterns

  1999cited by this paper
• On the intrinsic complexity of learning recursive functions

  1999cited by this paper
• Inductive inference of unbounded unions of pattern languages from positive data

  1996influential reference
• On the Intrinsic Complexity of Learning

  1995cited by this paper
• On the intrinsic complexity of language identification

  1994cited by this paper
• Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data

  1994cited by this paper
• The correct definition of finite elasticity: corrigendum to identification of unions

  1991cited by this paper
• Prudence and Other Conditions on Formal Language Learning

  1990cited by this paper
• Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists

  1990cited by this paper
• Identification of unions of languages drawn from an identifiable class

  1989cited by this paper
• A study of inductive inference machines

  1986cited by this paper
• Inductive Inference of Formal Languages from Positive Data

  1980influential reference
• Toward a Mathematical Theory of Inductive Inference

  1975cited by this paper
• The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept

  1972cited by this paper
• Theory of Recursive Functions and Effective Computability.

  1969influential reference
• Theory of Recursive Functions and Effective Computability

  1969cited by this paper
• A Machine-Independent Theory of the Complexity of Recursive Functions

  1967cited by this paper
• 1967

  1967influential reference
• Language Identification in the Limit

  1967influential reference

• Preference-based Teaching of Unions of Geometric Objects

  2017cites this paper
• Learning concepts and their unions from positive data with refinement operators

  2015cites this paper
• A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators

  2014cites this paper
• Learning multiple languages in groups

  2007cites this paper