Fast learning of restricted regular expressions and dtds
From MaRDI portal
Publication:269337
DOI10.1007/S00224-014-9559-3zbMATH Open1333.68154OpenAlexW2026994445MaRDI QIDQ269337FDOQ269337
Authors: Dominik D. Freydenberger, Timo Kötzing 
Publication date: 18 April 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/26547
Recommendations
chain regular expressiondescriptive generalizationsingle-occurrence regular expressionsubregular language learning
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- Algorithms for learning regular expressions from positive data
- Finding patterns common to a set of strings
- Fast learning of restricted regular expressions and dtds
- Inferring descriptive generalisations of formal languages
- Complexity of decision problems for XML schemas and chain regular expressions
- Stochastic finite learning of the pattern languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Existence and nonexistence of descriptive patterns
Cited In (8)
- Title not available (Why is that?)
- Fast learning of restricted regular expressions and dtds
- Inferring descriptive generalisations of formal languages
- Generating, sampling and counting subclasses of regular tree languages
- Title not available (Why is that?)
- Inferring Deterministic Regular Expression with Unorder
- Title not available (Why is that?)
- Grammatical Inference: Algorithms and Applications
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)
