Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Programming perl
The SGML handbook
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Handbook of theoretical computer science (vol. A)
Regular expressions into finite automata
Theoretical Computer Science
Local languages and the Berry-Sethi algorithm
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Markup Languages
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Concrete Math
Unambiguity of Extended Regular Expressions in SGML Document Grammars
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Online evaluation of regular tree queries
Nordic Journal of Computing
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
The validation of SGML content models
Mathematical and Computer Modelling: An International Journal
Simple off the shelf abstractions for XML schema
ACM SIGMOD Record
Generating XML structure using examples and constraints
Proceedings of the VLDB Endowment
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Checking determinism of XML Schema content models in optimal time
Information Systems
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Checking determinism of regular expressions with counting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Regular expressions with numeric occurrence indicators are an extension of traditional regular expressions, which let the required minimum and the allowed maximum number of iterations of subexpressions be described with numeric parameters. We consider the problem of testing whether a given regular expression E with numeric occurrence indicators is 1-unambiguous or not. This condition means, informally, that any prefix of any word accepted by expression E determines a unique path of matching symbol positions in E. One-unambiguity appears as a validity constraint in popular document schema languages such as SGML and XML DTDs (document type definitions) and XML Schema; the last one both includes numeric occurrence indicators and requires one-unambiguity of expressions. Previously published solutions for testing the one-unambiguity of regular expressions with numeric occurrence indicators are either erroneous or require exponential time. The main contribution of this paper is a polynomial-time method for solving this problem, and a formal proof of its correctness.