Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
From MaRDI portal
Recommendations
Cited in
(17)- CaRet with forgettable past
- Visibly linear temporal logic
- A grammatical characterization of alternating pushdown automata
- Visibly linear dynamic logic
- Temporal logics with language parameters
- Visibly rational expressions
- Hybrid and first-order complete extensions of CaRet
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Improved upper bounds for determinizing NIDPDAs with limited nondeterminism
- VLDL satisfiability and model checking via tree automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Existential and universal width of alternating finite automata
- Stack-aware hyperproperties
- Games for active XML revisited
- Temporal logics with language parameters
- Probabilistic input-driven pushdown automata
This page was built for publication: Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525656)