Language learning from texts: Degrees of intrinsic complexity and their characterizations
From MaRDI portal
Publication:1604194
DOI10.1006/JCSS.2001.1759zbMath1006.68108OpenAlexW2131576593MaRDI QIDQ1604194
Sanjay Jain, Rolf Wiehagen, E. B. Kinber
Publication date: 4 July 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1759
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (7)
Intrinsic complexity of learning geometrical concepts from positive data ⋮ Intrinsic complexity of partial learning ⋮ Topological Properties of Concept Spaces ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Topological properties of concept spaces (full version) ⋮ Mind change efficient learning ⋮ Intrinsic Complexity of Partial Learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Prudence and other conditions on formal language learning
- Characterizing language identification by standardizing operations
- Language learning from texts: Mindchanges, limited memory and monotonicity
- The intrinsic complexity of language identification
- On the intrinsic complexity of learning
- On the complexity of inductive inference
- Toward a mathematical theory of inductive inference
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- The structure of intrinsic complexity of learning
- Inductive inference of recursive functions: Qualitative theory
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Some decidability results on grammatical inference and complexity
- Language identification in the limit
This page was built for publication: Language learning from texts: Degrees of intrinsic complexity and their characterizations
