Learning Efficiency of Very Simple Grammars from Positive Data

DOI10.1007/978-3-540-75225-7_20MaRDI QIDQ3520062zbMATH OpenOpenAlexFDO

Authors Ryo Yoshinaka

Publication date 19 August 2008

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

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

Mathematics Subject Classification ID

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

Recommendations

• Learning efficiency of very simple grammars from positive data
• Polynomial-time identification of very simple grammars from positive data.
• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• scientific article; zbMATH DE number 2019600
• Simple flat languages: a learnable class in the limit from positive data

Cites work

• Algorithmic Learning Theory
• 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
• On polynomial-time learnability in the limit of strictly deterministic automata
• 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

Cited in

(12)

• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• Learning indexed families of recursive languages from positive data: A survey
• Learning efficiency of very simple grammars from positive data
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• Efficiency in the identification in the limit learning paradigm
• Resource restricted computability theoretic learning: Illustrative topics and problems
• 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?)
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Iterative Learning of Simple External Contextual Languages

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 Q3520062)