Inferring pure context-free languages from positive data
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 996381
- Inferring uniquely terminating regular languages from positive data
- scientific article; zbMATH DE number 2077185
- Inductive inference of context-free languages based on context-free expressions
- scientific article; zbMATH DE number 996380
- scientific article; zbMATH DE number 1104352
- Inferring regular trace languages from positive and negative samples
- On the amount of nonconstructivity in learning formal languages from positive data
- A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
Cited in
(10)- On the structural grammatical inference problem for some classes of context-free grammars
- LARS: a learning algorithm for rewriting systems
- scientific article; zbMATH DE number 1670713 (Why is no real title available?)
- Inferring uniquely terminating regular languages from positive data
- On the Inference of Finite State Automata from Positive and Negative Data
- scientific article; zbMATH DE number 996381 (Why is no real title available?)
- Learning Context-Sensitive Languages from Linear Structural Information
- Inductive inference of context-free languages based on context-free expressions
- Inferring regular languages by merging nonterminals
- scientific article; zbMATH DE number 2077185 (Why is no real title available?)
This page was built for publication: Inferring pure context-free languages from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714262)
