Pages that link to "Item:Q2921977"
From MaRDI portal
The following pages link to Input-Driven Pushdown Automata with Limited Nondeterminism (Q2921977):
Displaying 11 items.
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the determinization of event-clock input-driven pushdown automata (Q2097230) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q2164744) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- (Q5740419) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)