Good-for-games -pushdown automata

DOI10.1145/3373718.3394737MaRDI QIDQ5145673zbMATH OpenOpenAlexFDO

Authors Karoliina Lehtinen, Martín G. Zimmermann

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.04392

zbMATH Keywords

contextfree languagesgood-for-games automatainfinite gamespushdown automata

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 7471692
• On Determinisation of Good-for-Games Automata
• How deterministic are good-for-games automata?
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Regularity problems for weak pushdown -automata and games

Cited in

(12)

• Regularity problems for weak pushdown -automata and games
• On Determinisation of Good-for-Games Automata
• Canonicity in GFG and transition-based automata
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• How deterministic are good-for-games automata?
• Are good-for-games automata good for probabilistic model checking?
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Good for games automata: from nondeterminism to alternation
• On (I/O)-Aware Good-For-Games Automata
• A hierarchy of nondeterminism
• On the minimisation of deterministic and history-deterministic generalised (co)Büchi automata

This page was built for publication: Good-for-games \(\omega \)-pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145673)