Regularity Problems for Visibly Pushdown Languages
From MaRDI portal
Publication:5449818
DOI10.1007/11672142_34zbMath1136.68414OpenAlexW1484039100MaRDI QIDQ5449818
Christof Löding, Olivier Serre, Vince Bárány
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_34
Related Items (14)
On Distinguishing NC $$^1$$ and NL ⋮ State complexity of operations on input-driven pushdown automata ⋮ Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ ⋮ Edit-Distance Between Visibly Pushdown Languages ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ Efficient determinization of visibly and height-deterministic pushdown automata ⋮ Amalgams of finite inverse semigroups and deterministic context-free languages. ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Operational state complexity of nested word automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Input-driven multi-counter automata ⋮ Unnamed Item
This page was built for publication: Regularity Problems for Visibly Pushdown Languages
