Pages that link to "Item:Q3503642"
From MaRDI portal
The following pages link to On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642):
Displaying 9 items.
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Notes on counting with finite machines (Q2978526) (← links)
- Height-Deterministic Pushdown Automata (Q3525562) (← links)
- On the complexity of membership and counting in height-deterministic pushdown automata (Q3589625) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)