Refutable language learning with a neighbor system.
type: Item
instance of: scholarly article
title: Refutable language learning with a neighbor system.
zbMATH Open document ID: 1038.68101
DOI: 10.1016/S0304-3975(02)00420-6
author: Yasuhito Mukouchi
author: Masako Sato
published in: Theoretical Computer Science
publication date: 2003-05-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1915303
zbMATH Keywords: Language learning
zbMATH Keywords: Refutable inference
zbMATH Keywords: Machine discovery
zbMATH Keywords: Neighbor system
MaRDI profile type: Publication
cites work: Finding patterns common to a set of strings
cites work: Inductive inference of formal languages from positive data
cites work: ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
cites work: Q4013548
cites work: Learning elementary formal systems
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Q4247008
cites work: Language identification in the limit
cites work: Program synthesis in the presence of infinite number of inaccuracies
cites work: Learning with refutation
cites work: Q4470570
cites work: Q3339245
cites work: Q4470573
cites work: Q4262057
cites work: Q4267817
cites work: Towards a mathematical theory of machine discovery from facts
cites work: Q4473559
cites work: Q5573961
cites work: Q4844750
cites work: Rich classes inferable from positive data: Length-bounded elementary formal systems
cites work: Monadic Elementary Formal Systems
cites work: Noisy inference and oracles
cites work: Short note: procedural semantics and negative information of elementary formal system
full work available at URL: s0304-3975(02)00420-6
OpenAlex ID: W2178754157
description: scientific article; zbMATH DE number 1915303