Refutable language learning with a neighbor system.
From MaRDI portal
Publication:1874230
DOI10.1016/S0304-3975(02)00420-6zbMath1038.68101OpenAlexW2178754157MaRDI QIDQ1874230
Masako Sato, Yasuhito Mukouchi
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)00420-6
Related Items
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Reflective inductive inference of recursive functions
Cites Work
- Towards a mathematical theory of machine discovery from facts
- Program synthesis in the presence of infinite number of inaccuracies
- Finding patterns common to a set of strings
- Learning elementary formal systems
- Learning with refutation
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Noisy inference and oracles
- Inductive inference of formal languages from positive data
- Short note: procedural semantics and negative information of elementary formal system
- A Machine-Independent Theory of the Complexity of Recursive Functions
- ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
- Monadic Elementary Formal Systems
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item