Regular expressions into finite automata
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
One-unambiguous regular languages
Information and Computation
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
The complexity of reasoning about pattern-based XML schemas
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Developing and analyzing XSDs through BonXai
Proceedings of the VLDB Endowment
Simplifying XML Schema: Single-type approximations of regular tree languages
Journal of Computer and System Sciences
Efficient separability of regular languages by subsequences and suffixes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules of the form (r,s) where r and s are regular expressions and can be seen as a type-free extension of DTDs with vertical regular expressions. Sets of such rules can be interpreted both in an existential or universal way. In the present paper, we study the succinctness of both semantics w.r.t. each other and w.r.t. the common abstraction of XSDs in terms of single-type extended DTDs. The investigation is carried out relative to three kinds of vertical pattern languages: regular, linear, and strongly linear patterns. We also consider the complexity of the simplification problem for each of the considered pattern-based schemas.