Label Star#
Info#
Full Name |
Per-Label Transitive Closure Regular Expression Template |
Class |
Regular |
Kind |
General |
Status |
designed — no data yet (real-world RPQ data will be provided later) |
Origin |
Grammar Parameters#
Parameter |
Description |
|---|---|
\(L\) |
A stored edge label of the graph; one query file per stored label |
Grammar Template#
Grammar Description#
The label star template generates the language of all strings consisting of repetitions of a single stored label: a pair \((u, v)\) is reachable if some path from \(u\) to \(v\) is labeled entirely by \(L\) — the transitive closure of the edges labeled \(L\).
This is a designed stub: no real-world RPQ data exists yet. When the data is provided, the query file lives inside the self-contained graph archive under queries/rpq/ (see File structure).
Example Grammars#
The template instantiated for the stored label \(a\):
a*