scientific article; zbMATH DE number 3339435

Cited in

(58)

Branching-time logics repeatedly referring to states
Variétés d'automates descendants d'arbres infinis
The greatest fixed-points and rational omega-tree languages
Alternation and -type Turing acceptors
The complementation problem for Büchi automata with applications to temporal logic
Automata-theoretic techniques for modal logics of programs
Topological characterizations of infinite tree languages
Alternating automata on infinite trees
Logical definability of fixed points
Generalized automata on infinite trees and Muller-McNaughton's theorem
On automata on infinite trees
Finite automata on directed graphs
Alternating automata, the weak monadic theory of trees and its complexity
The Borel hierarchy is infinite in the class of regular sets of trees
An axiom system for the weak monadic second order theory of two successors
The modal mu-calculus alternation hierarchy is strict
A branching time logic with past operators
On modal mu-calculus and Büchi tree automata
Fixed point characterization of infinite behavior of finite-state systems
Finite automata on timed \(\omega\)-trees
A gap property of deterministic tree languages.
Weak Muller acceptance conditions for tree automata
Ambiguous classes in \(\mu\)-calculi hierarchies
A characterization of Büchi tree automata
Fair simulation
The finite graph problem for two-way alternating automata.
\(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
Automata on infinite trees
On the separation question for tree languages
A language hierarchy and kitchens-type theorem for self-similar groups
On labeled birooted tree languages: algebras, automata and logic
The complexity of computing the behaviour of lattice automata on infinite trees
Relating word and tree automata
Unambiguous Büchi Is Weak
On the weak index problem for game automata
Temporal logic and fair discrete systems
The mu-calculus and Model Checking
On monadic theories of monadic predicates
Reliability-aware automatic composition approach for web services
On the strength of unambiguous tree automata
Deciding low levels of tree-automata hierarchy
Alternation is strict for higher-order modal fixpoint logic
Automata on infinite trees with counting constraints
Type reconstruction with recursive types and atomic subtyping
On Repetition Languages
Alternating automata: unifying truth and validity checking for temporal logics
Automata on infinite objects and their applications to logic and programming
Projection for Büchi Tree Automata with Constraints between Siblings
Fair simulation
Automatic presentations of structures
The modal mu-calculus alternation hierarchy is strict
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
Automata-theoretic characterisations of branching-time temporal logics
Alternating-time temporal logic
Automata-based axiom pinpointing
Infinitary tree languages recognized by \(\omega\)-automata
Hierarchies of weak automata and weak monadic formulas
The monadic second-order logic of graphs. IV: Definability properties of equational graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616162)