Learning elementary formal systems with queries.

DOI10.1016/S0304-3975(02)00417-6zbMath1038.68021WikidataQ59278897 ScholiaQ59278897MaRDI QIDQ1874227

Kouichi Hirata, Hiroki Arimura, Hiroshi Sakamoto

Publication date: 22 May 2003

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

zbMATH Keywords

learnabilityregular pattern languages

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Learning languages from positive data and a finite number of queries

Cites Work

• Towards a mathematical theory of machine discovery from facts
• Elementary formal systems, intrinsic complexity, and procrastination
• Classic learning
• Prediction-preserving reducibility
• Learning regular sets from queries and counterexamples
• Finding patterns common to a set of strings
• Learning elementary formal systems
• Lower bound methods and separation results for on-line learning models
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Foundations of inductive logic programming
• Learning unions of tree patterns using queries
• When won't membership queries help?
• Learning function-free Horn expressions
• Queries and concept learning
• A theory of the learnable
• Short note: procedural semantics and negative information of elementary formal system
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Monadic Elementary Formal Systems
• Inductive inference of unbounded unions of pattern languages from positive data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning elementary formal systems with queries.