Discovering unbounded unions of regular pattern languages from positive examples
From MaRDI portal
Recommendations
- Inductive inference of unbounded unions of pattern languages from positive data
- Inductive inference of unbounded unions of pattern languages from positive data
- scientific article; zbMATH DE number 2143051
- scientific article; zbMATH DE number 408772
- Algorithmic Learning Theory
- Characteristic sets for unions of regular pattern languages and compactness
- Compactness and learning of classes of unions of erasing regular pattern languages
- Inferring uniquely terminating regular languages from positive data
- On classes of tractable unrestricted regular expressions
- On learning unions of pattern languages and tree patterns
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A Space-Economical Suffix Tree Construction Algorithm
- An introduction to Kolmogorov complexity and its applications
- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- Inferring decision trees using the minimum description length principle
- Language identification in the limit
- Modeling by shortest data description
- Pattern recognition in several sequences: Consensus and alignment
Cited in
(7)- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Efficient learning of regular expressions from good examples
- Algorithmic Learning Theory
- Computing and Combinatorics
- Implementation and Application of Automata
- Inductive inference of unbounded unions of pattern languages from positive data
- Learning a subclass of regular patterns in polynomial time
This page was built for publication: Discovering unbounded unions of regular pattern languages from positive examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487429)
