Regular expressions into finite automata
Theoretical Computer Science
The complexity of word problems—this time with interleaving
Information and Computation
One-unambiguous regular languages
Information and Computation
Complexity of expressions allowing concurrency
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Term Rewriting Systems
Unambiguity of Extended Regular Expressions in SGML Document Grammars
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Regular Expressions with Counting: Weak versus Strong Determinism
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Checking determinism of regular expressions with counting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We study the membership problem for regular expressions extended with operators for unordered concatenation and numerical constraints. The unordered concatenation of a set of regular expressions denotes all sequences consisting of exactly one word denoted by each of the expressions. Numerical constraints are an extension of regular expressions used in many applications, e.g. text search (e.g., UNIX grep), document formats (e.g. XML Schema). Regular expressions with unordered concatenation and numerical constraints denote the same languages as the classical regular expressions, but, in certain important cases, exponentially more succinct. We show that the membership problem for regular expressions with unordered concatenation (without numerical constraints) is already NP-hard. We show a polynomial-time algorithm for the membership problem for regular expressions with numerical constraints and unordered concatenation, when restricted to a subclass called strongly 1-unambiguous.