Good-for-games -pushdown automata

DOI10.1145/3373718.3394737OpenAlexW3102720710MaRDI QIDQ5145673FDOQ5145673

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

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 \(\omega \)-automata and games

zbMATH Keywords

pushdown automatainfinite gamescontextfree languagesgood-for-games automata

Mathematics Subject Classification ID

Computer science (68-XX)

Cited In (9)

• On Determinisation of Good-for-Games Automata
• Token Games and History-Deterministic Quantitative-Automata
• Are good-for-games automata good for probabilistic model checking?
• Title not available (Why is that?)
• Title not available (Why is that?)
• On (I/O)-Aware Good-For-Games Automata
• How deterministic are good-for-games automata?
• Regularity problems for weak pushdown \(\omega \)-automata and games
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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)