Publication:4381391
From MaRDI portal
zbMath0892.68067MaRDI QIDQ4381391
Igor Walukiewicz, Damian Niwinski
Publication date: 1 April 1998
68Q45: Formal languages and automata
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Sensing as a Complexity Measure, How Deterministic are Good-For-Games Automata?, Index Problems for Game Automata, On the power of finite ambiguity in Büchi complementation, Minimization of automata for liveness languages, A gap property of deterministic tree languages., Ambiguous classes in \(\mu\)-calculi hierarchies, \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\), Automata on infinite trees, Multi-player games with LDL goals over finite traces, Relating word and tree automata, Unambiguous Büchi Is Weak, On the Weak Index Problem for Game Automata, On Synthesis of Specifications with Arithmetic, The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata, Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata