Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data

DOI10.1007/11894841_13zbMATH Open1168.68414OpenAlexW1576837624MaRDI QIDQ3522981FDOQ3522981

Authors: Matthew De Brecht, Akihiro Yamamoto 

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11894841_13

Recommendations

• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• scientific article; zbMATH DE number 1351089
• Inductive inference of unbounded unions of pattern languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Elementary formal systems, intrinsic complexity, and procrastination

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (6)

• Inductive inference of unbounded unions of pattern languages from positive data
• Topological properties of concept spaces (full version)
• Inductive inference of unbounded unions of pattern languages from positive data
• Mind change complexity of learning logic programs
• Topological Properties of Concept Spaces
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

This page was built for publication: Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data

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