scientific article; zbMATH DE number 1414302
From MaRDI portal
zbMath0941.68683MaRDI QIDQ4942639
Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Learning elementary formal systems with queries., Learning languages in a union, Learning of erasing primitive formal systems from positive examples, Inferring descriptive generalisations of formal languages, Learning unions of tree patterns using queries, Some classes of term rewriting systems inferable from positive data, Developments from enquiries into the learnability of the pattern languages from positive data, Learning concepts and their unions from positive data with refinement operators, Learning unions of tree patterns using queries, Inductive inference of unbounded unions of pattern languages from positive data, An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence, Ordered term tree languages which are polynomial time inductively inferable from positive data
