8 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.DB2010
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
Geert Jan Bex, Wouter Gelade, Frank Neven +1
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of p…
cs.CC2008
Dynamic Complexity of Formal Languages
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us…
cs.CC2008★ 8 cited
Succinctness of the Complement and Intersection of Regular Expressions
Wouter Gelade, Frank Neven
We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a…