Prompt delay
DOI10.4230/LIPICS.FSTTCS.2016.43zbMATH Open1391.68073arXiv1602.05045MaRDI QIDQ4636593FDOQ4636593
Authors: Felix Klein, Martín G. Zimmermann 
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1602.05045
Recommendations
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Temporal logic (03B44)
Cited In (13)
- Delay games with WMSO+U winning conditions
- Delayed Acceptance ABC-SMC
- Games with delays -- a Frankenstein approach
- Some Delays do not matter
- Approximating the minimal lookahead needed to win infinite games
- Time delay
- Accurate response by postponement
- Delay games with WMSO+U winning conditions
- Title not available (Why is that?)
- Finite-state strategies in delay games
- Finite-state strategies in delay games
- Promptness does not imply superlow cuppability
- The complexity of transducer synthesis from multi-sequential specifications
This page was built for publication: Prompt delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636593)
