Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

DOI10.1016/J.TCS.2009.11.004MaRDI QIDQ2268856zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

closure operatorslearning from positive datamind change complexitypattern languagesreverse mathematicsunbounded unions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• scientific article; zbMATH DE number 1351089
• Inductive inference of unbounded unions of pattern languages from positive data
• Elementary formal systems, intrinsic complexity, and procrastination
• scientific article; zbMATH DE number 512873

Cites work

• Countable algebra and set existence axioms
• Elementary formal systems, intrinsic complexity, and procrastination
• Generalized notions of mind change complexity
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 3496154 (Why is no real title available?)
• scientific article; zbMATH DE number 1176133 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 967945 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Language identification in the limit
• Learning algebraic structures from text
• Learning Theory
• Logic, language and computation. Festschrift in Honor of Satoru Takasu
• On notation for ordinal numbers
• On the role of procrastination in machine learning
• Ordering by Divisibility in Abstract Algebras
• Ordinal mind change complexity of language identification
• Ordinal numbers and the Hilbert basis theorem
• The structure of intrinsic complexity of learning
• Topological properties of concept spaces (full version)
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory

Cited in

(13)

• Mind change complexity of learning logic programs
• Probabilistic computability and choice
• Learning algebraic structures with the help of Borel equivalence relations
• Mind change speed-up for learning languages from positive data
• Inductive inference and reverse mathematics
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• Closed choice and a uniform low basis theorem
• scientific article; zbMATH DE number 1351089 (Why is no real title available?)
• Foundations of online structure theory. II: The operator approach
• Inductive inference of unbounded unions of pattern languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Elementary formal systems, intrinsic complexity, and procrastination

This page was built for publication: Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

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