Publication:5616162
From MaRDI portal
zbMath0214.02208MaRDI QIDQ5616162
Publication date: 1970
68Q45: Formal languages and automata
Related Items
On the Strength of Unambiguous Tree Automata, Unnamed Item, Deciding low levels of tree-automata hierarchy, 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, Projection for Büchi Tree Automata with Constraints between Siblings, The modal mu-calculus alternation hierarchy is strict, Fair simulation, Reliability-aware automatic composition approach for web services, Automata on infinite objects and their applications to logic and programming, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, 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, 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 \(\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, 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
