Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata

DOI10.1109/LICS.2013.56zbMath1366.68142MaRDI QIDQ5271087

Filip Murlak, Michał Skrzypczak, Alessandro Facchini

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityalternating automataparity automatagame automatanondeterministic automataRabin-Mostowski index

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Index Problems for Game Automata ⋮ On the Weak Index Problem for Game Automata ⋮ Unnamed Item ⋮ \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) ⋮ Unambiguous Büchi Is Weak ⋮ Monoidal-closed categories of tree automata

This page was built for publication: Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata