Skip to Main content Skip to Navigation
Conference papers

Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction

François Coste 1 Jacques Nicolas 2
1 Dyliss - Dynamics, Logics and Inference for biological Systems and Sequences
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
2 GenScale - Scalable, Optimized and Parallel Algorithms for Genomics
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : To study more formally the approach by reduction initiated by ReGLiS, we propose a formal characterization of the grammars in reduced normal form (RNF) which can be learned by this approach. A modification of the core of ReGLiS is then proposed to ensure returning RNF grammars in polynomial time. This enables us to show that local substitutable languages represented by RNF context-free grammars are identifiable in polynomial time and thick data (IPTtD) from positive examples.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01872266
Contributor : François Coste <>
Submitted on : Tuesday, September 11, 2018 - 6:07:40 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:46 PM
Document(s) archivé(s) le : Wednesday, December 12, 2018 - 3:45:27 PM

Identifiers

  • HAL Id : hal-01872266, version 1

Citation

François Coste, Jacques Nicolas. Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction. ICGI 2018 - 14th International Conference on Grammatical Inference, Sep 2018, Wrocław, Poland. pp.155 - 168. ⟨hal-01872266⟩

Share

Metrics

Record views

148

Files downloads

106