scientific article

zbMath0978.68077MaRDI QIDQ2769435

Valerie King, Moshe Y. Vardi, Orna Kupferman

Publication date: 5 February 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2030/20300276

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (8)

Automata Theory and Model Checking ⋮ Zielonka DAG acceptance and regular languages over infinite words ⋮ A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ Value Iteration ⋮ New deterministic algorithms for solving parity games ⋮ State of Büchi Complementation ⋮ Measuring and Synthesizing Systems in Probabilistic Environments

This page was built for publication: