scientific article

zbMath0612.68046MaRDI QIDQ3753490

A. Włodzimierz Mostowski

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Rabin pair automatastandard regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (41)

μ-Bicomplete Categories and Parity Games ⋮ Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) ⋮ Quantitative solution of omega-regular games ⋮ Permissive strategies: from parity games to safety games ⋮ The mu-calculus and Model Checking ⋮ Graph Games and Reactive Synthesis ⋮ Determinization and memoryless winning strategies ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Robust worst cases for parity games algorithms ⋮ Axiomatising extended computation tree logic ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Index appearance record with preorders ⋮ Unambiguous Büchi automata. ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Semantic flowers for good-for-games and deterministic automata ⋮ The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata ⋮ Unnamed Item ⋮ Alternating automata with start formulas ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Certifying inexpressibility ⋮ Solving parity games via priority promotion ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ On model checking for the \(\mu\)-calculus and its fragments ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Computing the Rabin Index of a Parity Automaton ⋮ Church’s Problem and a Tour through Automata Theory ⋮ Note on winning positions on pushdown games with \(\omega\)-regular conditions ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ \( \omega \)-automata ⋮ Automata on infinite trees ⋮ Model Checking Omega-regular Properties for Quantum Markov Chains ⋮ Monadic second-order logic, graph coverings and unfoldings of transition systems ⋮ Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. ⋮ Pushdown processes: Games and model-checking ⋮ Hierarchies of weak automata and weak monadic formulas ⋮ Rabin vs. Streett Automata ⋮ Backward Deterministic Büchi Automata on Infinite Words ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

This page was built for publication: