Regular expressions into finite automata
Theoretical Computer Science
The complexity of word problems—this time with interleaving
Information and Computation
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Handbook of formal languages, vol. 1
One-unambiguous regular languages
Information and Computation
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Introduction to Algorithms
Rewriting Regular Inequalities (Extended Abstract)
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
An edit operation-based approach to the inclusion problem for DTDs
Proceedings of the 2007 ACM symposium on Applied computing
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Subtyping algorithm of regular tree grammars with disjoint production rules
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
One-unambiguous regular expressions are used in DTD. It is known that inclusion for one-unambiguous regular expressions is in PTIME. However, there has been no study on algorithms for the inclusion. In this paper we present algorithms for checking inclusion of one-unambiguous regular expressions. A classical way is based on automata, following which one algorithm is provided and improvements are given. The other algorithm is based on derivatives, utilizing a property introduced here that the number of derivatives of a one-unambiguous regular expression is finite. We conducted preliminary experiments by implementing typechecking of XML using the algorithms. The results show that typechecking using the new algorithms is more efficient than the typechecking used for XDuce.