Learning efficiency of very simple grammars from positive data

DOI10.1016/J.TCS.2009.01.012MaRDI QIDQ1017659zbMATH OpenOpenAlexFDO

Authors Ryo Yoshinaka

Publication date 12 May 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.01.012

zbMATH Keywords

grammatical inferenceidentification in the limitlearning efficiencyvery simple grammars

Mathematics Subject Classification ID

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

Recommendations

• Learning Efficiency of Very Simple Grammars from Positive Data
• Grammatical Inference: Algorithms and Applications
• Efficient learning of context-free grammars from positive structural examples
• Learning context-free grammars from structural data in polynomial time
• Learning languages from positive data and a limited number of short counterexamples
• On Learning Languages from Positive Data and a Limited Number of Short Counterexamples
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
• Learning regular languages from simple positive examples

Cites work

• Characteristic sets for polynomial grammatical inference
• Finding patterns common to a set of strings
• Grammatical Inference: Algorithms and Applications
• Grammatical inference for even linear languages based on control sets
• Ignoring data may be the only way to learn efficiently
• Inference of Reversible Languages
• Learning Efficiency of Very Simple Grammars from Positive Data
• On polynomial-time learnability in the limit of strictly deterministic automata
• Polynomial identification in the limit of substitutable context-free languages
• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• Polynomial-time identification of very simple grammars from positive data.
• Polynomial-time inference of arbitrary pattern languages
• Two decidability results for deterministic pushdown automata

Cited in

(12)

• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• Iterative learning of simple external contextual languages
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• Efficiency in the identification in the limit learning paradigm
• A note on polynomial-time learnability in the limit from positive data
• Learning regular languages from simple positive examples
• Polynomial-time identification of very simple grammars from positive data.
• Simple flat languages: a learnable class in the limit from positive data
• scientific article; zbMATH DE number 2019600 (Why is no real title available?)
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Learning Efficiency of Very Simple Grammars from Positive Data

This page was built for publication: Learning efficiency 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 Q1017659)