Pages that link to "Item:Q675049"
From MaRDI portal
The following pages link to Time-space tradeoffs for undirected graph traversal by graph automata (Q675049):
Displaying 5 items.
- Regular languages with variables on graphs (Q418127) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) (← links)
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
