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

DOI10.1006/inco.1994.1006zbMath0804.68130MaRDI 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 inference; logic program; elementary formal systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N17: Logic programming

03B80: Other applications of logic

Related Items

Inductive inference of unbounded unions of pattern languages from positive data, Learning of erasing primitive formal systems from positive examples, Developments from enquiries into the learnability of the pattern languages from positive data, Learning indexed families of recursive languages from positive data: A survey, Iterative learning of simple external contextual languages, Recent advances of grammatical inference, Ordinal mind change complexity of language identification, Mind change complexity of learning logic programs, 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., Iterative Learning of Simple External Contextual Languages