Unambiguous Büchi Is Weak

DOI10.1007/978-3-662-53132-7_26zbMath1436.68181arXiv1401.4025OpenAlexW2124229652MaRDI QIDQ2817398

Henryk Michalewski, Michał Skrzypczak

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

infinite treesunambiguityRabin-Mostowski index

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the power of finite ambiguity in Büchi complementation ⋮ On the Strength of Unambiguous Tree Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choice functions and well-orderings over the infinite binary tree
• Games for the \(\mu\)-calculus
• A gap property of deterministic tree languages.
• Ambiguous classes in \(\mu\)-calculi hierarchies
• Forms of Determinism for Automata (Invited Talk)
• On Recognizable Tree Languages Beyond the Borel Hierarchy
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
• The Wadge Hierarchy of Deterministic Tree Languages

This page was built for publication: Unambiguous Büchi Is Weak