Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Correspondence and translation for heterogeneous data
Theoretical Computer Science
Universal Regular Path Queries
Higher-Order and Symbolic Computation
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Formal Methods in System Design
Predicting locality phases for dynamic memory optimization
Journal of Parallel and Distributed Computing
Survey of graph database models
ACM Computing Surveys (CSUR)
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on 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)
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 14th International Conference on Database Theory
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Variable automata over infinite alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Spanners: a formal framework for information extraction
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 32nd symposium on Principles of database systems
Querying Regular Graph Patterns
Journal of the ACM (JACM)
| Hi-index | 5.23 |
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainty semantics, the word must be denoted by every such expression. Such languages are regular, and we show that they naturally arise in several applications such as querying graph databases and program analysis. As the main contribution of the paper, we provide a complete characterization of the complexity of the main computational problems related to such languages: nonemptiness, universality, containment, membership, as well as the problem of constructing NFAs capturing such languages. We also look at the extension when domains of variables could be arbitrary regular languages, and show that under the certainty semantics, languages remain regular and the complexity of the main computational problems does not change.