Pages that link to "Item:Q3940852"
From MaRDI portal
The following pages link to Parallel and two-way automata on directed ordered acyclic graphs (Q3940852):
Displaying 19 items.
- Regular languages with variables on graphs (Q418127) (← links)
- An axiomatization of graphs (Q707454) (← links)
- Tree-walking automata cannot be determinized (Q817841) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Alternating tree automata (Q1077932) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- Graph automata (Q2481961) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS (Q2856022) (← links)
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids (Q3098038) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- On a code problem concerning planar acyclic graphs (Q3350765) (← links)
