Learning elementary formal systems

DOI10.1016/0304-3975(92)90068-QMaRDI QIDQ1186429zbMATH OpenOpenAlexFDO

Authors S. Arikawa, Takeshi Shinohara, Akihiro Yamamoto

Publication date 28 June 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90068-q

zbMATH Keywords

language learninginductive inference algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 408771
• Learning elementary formal systems with queries.
• scientific article; zbMATH DE number 2080667
• scientific article; zbMATH DE number 67628
• Advanced elementary formal systems.
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 107878

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3945331 (Why is no real title available?)
• scientific article; zbMATH DE number 3982507 (Why is no real title available?)
• scientific article; zbMATH DE number 50933 (Why is no real title available?)
• scientific article; zbMATH DE number 3590511 (Why is no real title available?)
• scientific article; zbMATH DE number 3992928 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 3413831 (Why is no real title available?)
• A theory of the learnable
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning regular sets from queries and counterexamples
• Monadic Elementary Formal Systems

Cited in

(29)

• scientific article; zbMATH DE number 2084848 (Why is no real title available?)
• Algorithmic Learning Theory
• On approximately identifying concept classes in the limit
• Incremental concept learning for bounded data mining.
• The synthesis of language learners.
• Synthesizing learners tolerating computable noisy data
• Advanced elementary formal systems.
• Refutable language learning with a neighbor system.
• Learning of erasing primitive formal systems from positive examples
• Towards a mathematical theory of machine discovery from facts
• Algorithmic Learning Theory
• Hypothesis finding based on upward refinement of residue hypotheses.
• scientific article; zbMATH DE number 408771 (Why is no real title available?)
• scientific article; zbMATH DE number 2080667 (Why is no real title available?)
• Mind change complexity of learning logic programs
• Learning of erasing primitive formal systems from positive examples
• From learning in the limit to stochastic finite learning
• Inductive inference of unbounded unions of pattern languages from positive data
• Learning elementary formal systems with queries.
• Learning a subclass of regular patterns in polynomial time
• Developments from enquiries into the learnability of the pattern languages from positive data
• Automatic learning from positive data and negative counterexamples
• Short note: procedural semantics and negative information of elementary formal system
• Learnability of XML document transformation rules using typed EFSs
• Generating languages by a derivation procedure for elementary formal systems
• Gold-style learning theory. A selection of highlights since Gold
• Parsimony hierarchies for inductive inference
• scientific article; zbMATH DE number 67628 (Why is no real title available?)
• Incremental learning of logic programs

This page was built for publication: Learning elementary formal systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186429)