Pages that link to "Item:Q2396831"
From MaRDI portal
The following pages link to State complexity of operations on input-driven pushdown automata (Q2396831):
Displaying 10 items.
- Additive number theory via automata theory (Q1987517) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- Sums of Palindromes: an Approach via Automata (Q3304153) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← 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)
- Exact descriptional complexity of determinization of input-driven pushdown automata (Q6666802) (← links)
