Pages that link to "Item:Q5449818"
From MaRDI portal
The following pages link to Regularity Problems for Visibly Pushdown Languages (Q5449818):
Displayed 10 items.
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Amalgams of finite inverse semigroups and deterministic context-free languages. (Q1758227) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (Q2946409) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- On Distinguishing NC $$^1$$ and NL (Q3451114) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- (Q5376652) (← links)