Case-based representation and learning of pattern languages

DOI10.1016/0304-3975(95)91134-CzbMath0873.68109OpenAlexW1590529048WikidataQ127436510 ScholiaQ127436510MaRDI QIDQ674401

Klaus P. Jantke, Steffen Lange

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)91134-c

Mathematics Subject Classification ID

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

Related Items

Recent advances of grammatical inference, Reflecting and self-confident inductive inference machines

Cites Work

• Algorithmic learning theory. 4th international workshop, ALT '93, Tokyo, Japan, November 8-10, 1993. Proceedings
• Monotonic and non-monotonic inductive inference
• Polynomial-time inference of arbitrary pattern languages
• Finding patterns common to a set of strings
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Characterizations of monotonic and dual monotonic language learning
• Editing by example
• Inclusion is undecidable for pattern languages
• Language identification in the limit
• 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