Pages that link to "Item:Q1749148"
From MaRDI portal
The following pages link to Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148):
Displaying 9 items.
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Detecting useless transitions in pushdown automata (Q2042722) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- On Model Checking for Visibly Pushdown Automata (Q2890214) (← links)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
- Height-Deterministic Pushdown Automata (Q3525562) (← links)
- On the complexity of membership and counting in height-deterministic pushdown automata (Q3589625) (← links)
- On the Expressive Power of 2-Stack Visibly Pushdown Automata (Q3623011) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)