Pages that link to "Item:Q2271435"
From MaRDI portal
The following pages link to Nondeterministic state complexity of nested word automata (Q2271435):
Displaying 15 items.
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Sums of Palindromes: an Approach via Automata (Q3304153) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← 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)
