Polynomial-time identification of very simple grammars from positive data.
From MaRDI portal
Publication:1874233
DOI10.1016/S0304-3975(02)00423-1zbMath1038.68074OpenAlexW1965255070MaRDI QIDQ1874233
Publication date: 22 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00423-1
Related Items (11)
LARS: a learning algorithm for rewriting systems ⋮ Learning tree languages from text ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ Identification in the Limit of k,l-Substitutable Context-Free Languages ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Grammatical inference of directed acyclic graph languages with polynomial time complexity ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Learning efficiency of very simple grammars from positive data
Cites Work
- Towards a mathematical theory of machine discovery from facts
- The grammatical inference problem for the Szilard languages of linear grammars
- Learning regular sets from queries and counterexamples
- Remarks on the structural grammatical inference problem for context-free grammars
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- On polynomial-time learnability in the limit of strictly deterministic automata
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Associate languages and derivational complexity of formal grammars and languages
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polynomial-time identification of very simple grammars from positive data.
