Fast learning of restricted regular expressions and DTDs

© 2014, Springer Science+Business Media New York. We study the problem of generalizing from a finite sample to a language taken from a predefined language class. The two language classes we consider are subsets of the regular languages and have significance in the specification of XML documents (the...

Full description

Saved in:
Bibliographic Details
Main Authors: Dominik Freydenberger, Timo Kotzing
Format: Default Article
Published: 2014
Subjects:
Distributed computing and systems software not elsewhere classified
Theory of computation not elsewhere classified
Other information and computing sciences not elsewhere classified
Subregular language learning
Single-occurrence regular expression
Chain regular expression
Descriptive generalization
Computation Theory and Mathematics
Information and Computing Sciences not elsewhere classified
Distributed Computing
Online Access:https://hdl.handle.net/2134/26547
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items