| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction
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.
Cited literature [28 references]
https://hal.inria.fr/hal-01872266
Contributor : François Coste <>
Submitted on : Tuesday, September 11, 2018 - 6:07:40 PM
Last modification on : Saturday, July 11, 2020 - 3:14:57 AM
Long-term archiving on: : Wednesday, December 12, 2018 - 3:45:27 PM
Contributor : François Coste <>
Submitted on : Tuesday, September 11, 2018 - 6:07:40 PM
Last modification on : Saturday, July 11, 2020 - 3:14:57 AM
Long-term archiving on: : Wednesday, December 12, 2018 - 3:45:27 PM