scientific article; zbMATH DE number 7471692
From MaRDI portal
Publication:5028456
Karoliina Lehtinen, Martín G. Zimmermann
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2001.04392
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On history-deterministic one-counter nets ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ History-deterministic timed automata are not determinizable ⋮ Token Games and History-Deterministic Quantitative-Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
- \(\omega\)-computations on deterministic pushdown machines
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- Logic for \(\omega\)-pushdown automata
- Regularity Problems for Weak Pushdown ω-Automata and Games
- On Determinisation of Good-for-Games Automata
- Visibly pushdown languages
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Good-for-games ω-Pushdown Automata
- Nondeterminism in the Presence of a Diverse or Unknown Future
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Topological properties of omega context-free languages
