scientific article; zbMATH DE number 1136070
From MaRDI portal
Publication:4381381
zbMath0892.03005MaRDI QIDQ4381381
Publication date: 1 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Index Problems for Game Automata ⋮ The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames ⋮ Unnamed Item ⋮ On the separation question for tree languages ⋮ Theμ-calculus alternation-depth hierarchy is strict on binary trees ⋮ Fixpoint alternation: arithmetic, transition systems, and the binary tree ⋮ On the Strength of Unambiguous Tree Automata ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Unambiguous Büchi Is Weak ⋮ Domain mu-calculus ⋮ On the Way to Alternating Weak Automata ⋮ Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata