Fast learning of restricted regular expressions and dtds
From MaRDI portal
Publication:269337
DOI10.1007/S00224-014-9559-3zbMath1333.68154OpenAlexW2026994445MaRDI QIDQ269337
Timo Kötzing, Dominik D. Freydenberger
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
chain regular expressiondescriptive generalizationsingle-occurrence regular expressionsubregular language learning
Related Items (5)
Fast learning of restricted regular expressions and dtds ⋮ Inferring descriptive generalisations of formal languages ⋮ Inferring Deterministic Regular Expression with Unorder ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast learning of restricted regular expressions and dtds
- Inferring descriptive generalisations of formal languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Existence and nonexistence of descriptive patterns
- Algorithms for learning regular expressions from positive data
- Finding patterns common to a set of strings
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
- Language identification in the limit
- Stochastic finite learning of the pattern languages
This page was built for publication: Fast learning of restricted regular expressions and dtds