Pages that link to "Item:Q3525563"
From MaRDI portal
The following pages link to Minimizing Variants of Visibly Pushdown Automata (Q3525563):
Displaying 13 items.
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q2164744) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Tinput-Driven Pushdown Automata (Q2945881) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- (Q5216306) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q6131193) (← links)
