scientific article
From MaRDI portal
Publication:3739111
zbMath0603.03005MaRDI QIDQ3739111
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items
Memoryless determinacy of parity and mean payoff games: a simple proof, On control of systems modelled as deterministic Rabin automata, Uniform inevitability is tree automaton ineffable, Deciding Parity Games in Quasi-polynomial Time, Logic programming approach to automata-based decision procedures, Control of \(\omega\)-automata under state fairness assumptions, Deciding the unguarded modal -calculus, Parity Games and Propositional Proofs, TABLEAUX: A general theorem prover for modal logics, The Modal μ-Calculus Caught Off Guard, Model Theoretic Syntax and Parsing, An Automata-Theoretic Approach to Infinite-State Systems, On model checking for the \(\mu\)-calculus and its fragments, Verification by augmented abstraction: The automata-theoretic view, Incremental reasoning on monadic second-order logics with logic programming, Tighter Bounds for the Determinisation of Büchi Automata, Model Checking-Based Genetic Programming with an Application to Mutual Exclusion, Alternating automata: Unifying truth and validity checking for temporal logics, Relating word and tree automata, Complexity of weak acceptance conditions in tree automata., Pushdown processes: Games and model-checking
