One-unambiguous regular languages
Information and Computation
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Optimizing Regular Path Expressions Using Graph Schemas
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Static analysis of xml transformation and schema languages
Static analysis of xml transformation and schema languages
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
Survey of graph database models
ACM Computing Surveys (CSUR)
Simple off the shelf abstractions for XML schema
ACM SIGMOD Record
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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)
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
ACM Computing Surveys (CSUR)
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
Complexity measures for regular expressions
Journal of Computer and System Sciences
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simplifying XML schema: single-type approximations of regular tree languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
| Hi-index | 0.00 |
Regular expressions can be found in a wide array of technology for data processing on the web. We are motivated by two such technologies: schema languages for XML and query languages for graph-structured or linked data. Our focus is on theoretical aspects of regular expressions in these contexts.