Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data

DOI10.1007/11872436_5MaRDI QIDQ3541844zbMATH OpenOpenAlexFDO

Authors Ryo Yoshinaka

Publication date 27 November 2008

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

Full work available at URL https://doi.org/10.1007/11872436_5

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• Polynomial-time identification of very simple grammars from positive data.
• Learning Efficiency of Very Simple Grammars from Positive Data
• Learning efficiency of very simple grammars from positive data
• scientific article; zbMATH DE number 996379
• scientific article; zbMATH DE number 2019600

Cited in

(7)

• A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
• Learning efficiency of very simple grammars from positive data
• Multiple context-free tree grammars: lexicalization and characterization
• A note on polynomial-time learnability in the limit from positive data
• Polynomial-time identification of very simple grammars from positive data.
• scientific article; zbMATH DE number 2019600 (Why is no real title available?)
• Learning Efficiency of Very Simple Grammars from Positive Data

This page was built for publication: Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data

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