Pages that link to "Item:Q3088065"
From MaRDI portal
The following pages link to State Complexity of Operations on Input-Driven Pushdown Automata (Q3088065):
Displayed 6 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)