Fast learning of restricted regular expressions and dtds
From MaRDI portal
(Redirected from Publication:269337)
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Algorithms for learning regular expressions from positive data
- Complexity of decision problems for XML schemas and chain regular expressions
- Developments from enquiries into the learnability of the pattern languages from positive data
- Existence and nonexistence of descriptive patterns
- Fast learning of restricted regular expressions and dtds
- Finding patterns common to a set of strings
- Inferring descriptive generalisations of formal languages
- Introduction to algorithms
- Language identification in the limit
- Stochastic finite learning of the pattern languages
Cited in
(8)- scientific article; zbMATH DE number 980420 (Why is no real title available?)
- Fast learning of restricted regular expressions and dtds
- Inferring deterministic regular expression with unorder
- The complexity of SORE-definability problems
- Grammatical Inference: Algorithms and Applications
- scientific article; zbMATH DE number 7561594 (Why is no real title available?)
- Inferring descriptive generalisations of formal languages
- Generating, sampling and counting subclasses of regular tree languages
This page was built for publication: Fast learning of restricted regular expressions and dtds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269337)