Learning context-free grammars using tabular representations
From MaRDI portal
Publication:2485075
Recommendations
- scientific article; zbMATH DE number 1670726
- Learning context-free grammars from structural data in polynomial time
- Efficient learning of context-free grammars from positive structural examples
- Grammatical Inference: Algorithms and Applications
- Distributional Learning of Simple Context-Free Tree Grammars
Cites work
- scientific article; zbMATH DE number 1670722 (Why is no real title available?)
- scientific article; zbMATH DE number 1670726 (Why is no real title available?)
- scientific article; zbMATH DE number 2019603 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A note on the number of queries needed to identify regular languages
- Complexity of automaton identification from given data
- Efficient learning of context-free grammars from positive structural examples
- Inference of Reversible Languages
- Learning context-free grammars from structural data in polynomial time
- On the complexity of minimum inference of regular sets
- Recent advances of grammatical inference
Cited in
(6)- Learning Cover Context-Free Grammars from Structural Data
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Learning context-free grammars from structural data in polynomial time
- scientific article; zbMATH DE number 1670726 (Why is no real title available?)
- Using contextual representations to efficiently learn context-free languages
- Grammatical Inference: Algorithms and Applications
This page was built for publication: Learning context-free grammars using tabular representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485075)