Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Disambiguation of SGML Content Models
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Checking determinism of regular expressions with counting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i.e., the unique particle attribution (UPA) constraint, which means that the content models are deterministic regular expressions. This determinism is defined semantically without known syntactic definition for it, thus making it difficult for users to design. Presently however, no work can provide diagnostic information if content models are nondeterministic, although this will be of great help for designers to understand and modify nondeterministic ones. In the paper we investigate algorithms that check if a regular expression is deterministic and provide diagnostic information if the expression is not deterministic. With the information provided by the algorithms, designers will be clearer about why an expression is not deterministic. Thus it contributes to reducing the difficulty of designing XML Schema.