Pages that link to "Item:Q2922039"
From MaRDI portal
The following pages link to Reachability in Pushdown Register Automata (Q2922039):
Displaying 6 items.
- Regular and context-free nominal traces (Q530218) (← links)
- Decidability of the reachability problem for pushdown relational automata (Q1057653) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
- $$\textsc {Reach}$$ on Register Automata via History Independence (Q6487290) (← links)