Regular languages with variables on graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43003 (Why is no real title available?)
- scientific article; zbMATH DE number 517039 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1950751 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Database Theory - ICDT 2005
- Finding Regular Simple Paths in Graph Databases
- Minimal Ascending and Descending Tree Automata
- On the equivalence, containment, and covering problems for the regular and context-free languages
- On the power of tree-walking automata.
- Parallel and two-way automata on directed ordered acyclic graphs
- Pattern expressions and pattern automata
- Programming Python.
- Programming Techniques: Regular expression search algorithm
- Regular expressions with nested levels of back referencing form a hierarchy
- Time-space tradeoffs for undirected graph traversal by graph automata
- Weighted path queries on semistructured databases
Cited in
(6)
This page was built for publication: Regular languages with variables on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418127)