5 years ago in 2014, the last time I looked into this, I was making 6s Vines to “capture my thoughts” with.
Spatiotemporal databases caught my attention and I made a little chant.
Indeed! Now, tie https://en.wikipedia.org/wiki/Dyck_language computation to a spatiotemporal database. Timestamp each step of the matching process via whatever algorithm is best along with each result.
This grounds the process itself onto a fixed field.
That additional information allows you to run other algorithms to check calculation times to find “best position in the queue”.
HOWEVER, you’ve just provided a context for the context-free language.
YET, ultimately, you must for actual computability.
A quick shows its been mapped to “Halpern-Shoham logic” but…
https://arxiv.org/abs/1010.4529 its current form is undecidable as it stands.