Learning context-free grammars using tabular representations
From MaRDI portal
Publication:2485075
DOI10.1016/J.PATCOG.2004.03.021zbMATH Open1101.68638OpenAlexW1990362766MaRDI QIDQ2485075FDOQ2485075
Authors: Y. Sakakibara
Publication date: 3 August 2005
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2004.03.021
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
- Title not available (Why is that?)
- Inference of Reversible Languages
- Learning context-free grammars from structural data in polynomial time
- Complexity of automaton identification from given data
- On the complexity of minimum inference of regular sets
- Efficient learning of context-free grammars from positive structural examples
- A note on the number of queries needed to identify regular languages
- Recent advances of grammatical inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Learning Cover Context-Free Grammars from Structural Data
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Title not available (Why is that?)
- Learning context-free grammars from structural data in polynomial time
- Using contextual representations to efficiently learn context-free languages
- Grammatical Inference: Algorithms and Applications
Uses Software
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)