Compactness and learning of classes of unions of erasing regular pattern languages

DOI10.1007/3-540-36169-3_24MaRDI QIDQ4420757zbMATH OpenFDO

Authors Jin Uemura, Masako Sato

Publication date 18 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2533/25330293.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Characteristic sets for unions of regular pattern languages and compactness
• Inductive inference of unbounded unions of pattern languages from positive data
• scientific article; zbMATH DE number 2143051
• scientific article; zbMATH DE number 1910401
• scientific article; zbMATH DE number 2149593

Cited in

(8)

• Characteristic sets for unions of regular pattern languages and compactness
• scientific article; zbMATH DE number 2143051 (Why is no real title available?)
• scientific article; zbMATH DE number 1910401 (Why is no real title available?)
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Discovering unbounded unions of regular pattern languages from positive examples
• Learning of erasing primitive formal systems from positive examples
• Developments from enquiries into the learnability of the pattern languages from positive data

This page was built for publication: Compactness and learning of classes of unions of erasing regular pattern languages

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