Semantic flowers for good-for-games and deterministic automata

DOI10.1016/j.ipl.2023.106468MaRDI QIDQ6195342

Tansholpan Zhanabekova, Sven Schewe, Daniele Dell'Erba, Qiyi Tang

Publication date: 13 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

theory of computationflowers\(\omega\)-regular languagesacceptance conditionsgood-for-games automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Index Appearance Record for Transforming Rabin Automata into Parity Automata
• On Determinisation of Good-for-Games Automata
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• On ω-regular sets
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semantic flowers for good-for-games and deterministic automata