Pages that link to "Item:Q484313"
From MaRDI portal
The following pages link to Descriptional complexity of unambiguous input-driven pushdown automata (Q484313):
Displayed 8 items.
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)