Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
From MaRDI portal
Publication:2268856
DOI10.1016/j.tcs.2009.11.004zbMath1187.68306MaRDI QIDQ2268856
Akihiro Yamamoto, Matthew De Brecht
Publication date: 9 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.004
closure operators; reverse mathematics; pattern languages; learning from positive data; mind change complexity; unbounded unions
68Q45: Formal languages and automata
Related Items
Inductive inference and reverse mathematics, Closed choice and a uniform low basis theorem, Set systems: order types, continuous nondeterministic deformations, and quasi-orders, Probabilistic computability and choice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elementary formal systems, intrinsic complexity, and procrastination
- Topological properties of concept spaces (full version)
- Countable algebra and set existence axioms
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- On the role of procrastination in machine learning
- Logic, language and computation. Festschrift in Honor of Satoru Takasu
- Ordinal mind change complexity of language identification
- Generalized notions of mind change complexity
- Ordinal numbers and the Hilbert basis theorem
- Inductive inference of formal languages from positive data
- The structure of intrinsic complexity of learning
- Learning Theory
- Language identification in the limit
- On notation for ordinal numbers
- Ordering by Divisibility in Abstract Algebras
- Inductive inference of unbounded unions of pattern languages from positive data
- Learning algebraic structures from text
