Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

DOI10.1007/978-3-540-88009-7_8zbMath1177.68115OpenAlexW1688376865MaRDI QIDQ3528411

Hiro-O Tokunaga, Akihiro Yamamoto, Yuuichi Kameda

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_8

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• On uniform learnability of language families
• Inductive inference of formal languages from positive data
• Learning algebraic structures from text
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets