Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions).
Clemens GrabmayerPublished in: CoRR (2022)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- graph databases
- labeled graphs
- semistructured data
- graph data
- query language
- tree automata
- regular languages
- regular path queries
- deterministic finite automata
- xml schema
- query evaluation
- matching algorithm
- graph model
- context free grammars
- structured data
- database