scientific article
From MaRDI portal
Publication:2908872
DOI10.4230/LIPICS.FSTTCS.2010.412zbMath1245.68120MaRDI QIDQ2908872
Avital Steinitz, Udi Boker, Orna Kupferman
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3e5d.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Automata Theory and Model Checking ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Safraless LTL synthesis considering maximal realizability
This page was built for publication:
