scientific article; zbMATH DE number 6862071
From MaRDI portal
Publication:4636593
DOI10.4230/LIPIcs.FSTTCS.2016.43zbMath1391.68073arXiv1602.05045MaRDI QIDQ4636593
Felix Klein, Martín G. Zimmermann
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1602.05045
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items
Finite-state strategies in delay games, Approximating the minimal lookahead needed to win infinite games, Unnamed Item, Unnamed Item
