Fast Learning of Restricted Regular Expressions and DTDs
Open Access
- 14 August 2014
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 57 (4) , 1114-1158
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Inferring descriptive generalisations of formal languagesJournal of Computer and System Sciences, 2013
- Existence and nonexistence of descriptive patternsTheoretical Computer Science, 2010
- Complexity of Decision Problems for XML Schemas and Chain Regular ExpressionsSIAM Journal on Computing, 2010
- Simplifying XML schema2009
- Algorithms for learning regular expressions from positive dataInformation and Computation, 2009
- Expressiveness and complexity of XML SchemaACM Transactions on Database Systems, 2006
- Introduction to automata theory, languages, and computation, 2nd editionACM SIGACT News, 2001
- Inference of k-testable languages in the strict sense and application to syntactic pattern recognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1990
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980
- Language identification in the limitInformation and Control, 1967