Characteristic sets for unions of regular pattern languages and compactness

DOI10.1007/3-540-49730-7_17MaRDI QIDQ4247009zbMATH OpenFDO

Authors Masako Sato, Yasuhito Mukouchi, Dao Zheng

Publication date 21 March 2000

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

Full work available at URL https://doi.org/10.1007/3-540-49730-7_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1966624
• scientific article; zbMATH DE number 2143051
• scientific article; zbMATH DE number 996382
• Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses

Cited in

(7)

• Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
• Topological Properties of Concept Spaces
• scientific article; zbMATH DE number 1966624 (Why is no real title available?)
• Discovering unbounded unions of regular pattern languages 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
• Topological properties of concept spaces (full version)

This page was built for publication: Characteristic sets for unions of regular pattern languages and compactness

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