Publication:5616162
From MaRDI portal
zbMath0214.02208MaRDI QIDQ5616162
Publication date: 1970
Related Items
The finite graph problem for two-way alternating automata., Variétés d'automates descendants d'arbres infinis, The greatest fixed-points and rational omega-tree languages, A branching time logic with past operators, Type reconstruction with recursive types and atomic subtyping, Alternation and \(\omega\)-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, Temporal Logic and Fair Discrete Systems, The mu-calculus and Model Checking, On modal mu-calculus and Büchi tree automata, Alternating automata on infinite trees, Logical definability of fixed points, On the Weak Index Problem for Game Automata, Fixed point characterization of infinite behavior of finite-state systems, Finite automata on timed \(\omega\)-trees, Automatic presentations of structures, A gap property of deterministic tree languages., Reliability-aware automatic composition approach for web services, Unnamed Item, The complexity of computing the behaviour of lattice automata on infinite trees, Generalized automata on infinite trees and Muller-McNaughton's theorem, On automata on infinite trees, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, Finite automata on directed graphs, Alternating automata, the weak monadic theory of trees and its complexity, The modal mu-calculus alternation hierarchy is strict, Deciding low levels of tree-automata hierarchy, On the separation question for tree languages, Fair simulation, The Borel hierarchy is infinite in the class of regular sets of trees, On Monadic Theories of Monadic Predicates, \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\), Weak Muller acceptance conditions for tree automata, Ambiguous classes in \(\mu\)-calculi hierarchies, Automata-based axiom pinpointing, On the Strength of Unambiguous Tree Automata, Automata on infinite objects and their applications to logic and programming, Automata on infinite trees with counting constraints, An axiom system for the weak monadic second order theory of two successors, Unambiguous Büchi Is Weak, On Repetition Languages, The modal mu-calculus alternation hierarchy is strict, Alternating automata: Unifying truth and validity checking for temporal logics, Automata on infinite trees, A language hierarchy and kitchens-type theorem for self-similar groups, Branching-time logics repeatedly referring to states, A characterization of Büchi tree automata, Infinitary tree languages recognized by \(\omega\)-automata, Relating word and tree automata, Projection for Büchi Tree Automata with Constraints between Siblings, Fair simulation, Hierarchies of weak automata and weak monadic formulas, On labeled birooted tree languages: algebras, automata and logic, The monadic second-order logic of graphs. IV: Definability properties of equational graphs
