Parameterized regular expressions and their languages

DOI10.1016/j.tcs.2012.12.036zbMath1259.68104OpenAlexW2101571534MaRDI QIDQ1944774

Pablo Barceló, Leonid O. Libkin, Juan L. Reutter

Publication date: 27 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.036

zbMATH Keywords

graph databasescertainty semanticspossibility semanticsregular expressions with variables

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Static analysis of navigational XPath over graph databases ⋮ Querying Regular Graph Patterns ⋮ Containment of queries for graphs with data ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Document Spanners

This page was built for publication: Parameterized regular expressions and their languages