Learning Left-to-Right and Right-to-Left Iterative Languages
From MaRDI portal
Publication:3528409
DOI10.1007/978-3-540-88009-7_7zbMath1177.68112OpenAlexW1537086345MaRDI QIDQ3528409
Publication date: 16 October 2008
Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_7
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding patterns common to a set of strings
- Characteristic sets for polynomial grammatical inference
- Identification of function distinguishable languages.
- Polynomial-time identification of very simple grammars from positive data.
- Identification in the limit of categorial grammars
- Parallelism Increases Iterative Learning Power
- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Language identification in the limit
This page was built for publication: Learning Left-to-Right and Right-to-Left Iterative Languages