Rich classes inferable from positive data: Length-bounded elementary formal systems

DOI10.1006/inco.1994.1006zbMath0804.68130OpenAlexW2007946059MaRDI QIDQ1322482

Takeshi Shinohara

Publication date: 25 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1006

zbMATH Keywords

inductive inferencelogic programelementary formal systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17) Other applications of logic (03B80)

Related Items

Learning elementary formal systems with queries. ⋮ Advanced elementary formal systems. ⋮ Refutable language learning with a neighbor system. ⋮ Polynomial-time identification of very simple grammars from positive data. ⋮ Generating languages by a derivation procedure for elementary formal systems ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Recent advances of grammatical inference ⋮ On approximately identifying concept classes in the limit ⋮ Distributional Learning of Context-Free and Multiple Context-Free Grammars ⋮ Iterative Learning of Simple External Contextual Languages ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Distributional learning of parallel multiple context-free grammars ⋮ Learnability of automatic classes ⋮ Automatic learning from positive data and negative counterexamples ⋮ Iterative learning of simple external contextual languages ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Inductive inference of unbounded unions of pattern languages from positive data ⋮ Ordinal mind change complexity of language identification ⋮ MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY ⋮ SIMPLE FLAT LANGUAGES: A LEARNABLE CLASS IN THE LIMIT FROM POSITIVE DATA ⋮ Mind change complexity of learning logic programs