Regularity Problems for Visibly Pushdown Languages
From MaRDI portal
Recommendations
Cited in
(33)- Efficient determinization of visibly and height-deterministic pushdown automata
- Amalgams of finite inverse semigroups and deterministic context-free languages.
- P-hardness of the emptiness problem for visibly pushdown languages
- Operational state complexity of nested word automata
- Two-way Parikh automata with a visibly pushdown stack
- State complexity of operations on input-driven pushdown automata
- Visibly rational expressions
- The word problem for visibly pushdown languages described by grammars
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- Visibly rational expressions
- Edit-distance between visibly pushdown languages
- Visibly pushdown automata with multiplicities: finiteness and K-boundedness
- On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
- On the Membership Problem for Visibly Pushdown Languages
- Visibly pushdown languages
- An automata-theoretic approach to infinite-state systems
- A Grammatical Representation of Visibly Pushdown Languages
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
- Beyond Language Equivalence on Visibly Pushdown Automata
- Visibly pushdown automata and transducers with counters
- Invisible pushdown languages
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Visibly pushdown languages over sliding windows
- Determinisability of register and timed automata
- Streamability of nested word transductions
- scientific article; zbMATH DE number 7058469 (Why is no real title available?)
- Regular Realizability Problems and Context-Free Languages
- Automata, Languages and Programming
- Input-driven multi-counter automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
- The \(\text{AC}^0\)-complexity of visibly pushdown languages
- The \(\mathsf{AC}^0\)-complexity of visibly pushdown languages
This page was built for publication: Regularity Problems for Visibly Pushdown Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449818)
