Regular languages with variables on graphs
From MaRDI portal
Publication:418127
DOI10.1016/j.ic.2011.10.010zbMath1279.68174MaRDI QIDQ418127
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.10.010
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular expressions with nested levels of back referencing form a hierarchy
- Time-space tradeoffs for undirected graph traversal by graph automata
- Pattern expressions and pattern automata
- On the equivalence, containment, and covering problems for the regular and context-free languages
- On the power of tree-walking automata.
- Weighted path queries on semistructured databases
- Parallel and two-way automata on directed ordered acyclic graphs
- Minimal Ascending and Descending Tree Automata
- Finding Regular Simple Paths in Graph Databases
- Database Theory - ICDT 2005
- Programming Techniques: Regular expression search algorithm
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS