Fast learning of restricted regular expressions and DTDs
Dominik D. Freydenberger, Timo Kötzing · 2013
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 classes corresponding to so called chain regular expressions, Chares, and to single occurrence regular expressions, Sores).