scientific article; zbMATH DE number 2040951

MaRDI QIDQ4452102zbMATH OpenFDO

Authors Bakhadyr Khoussainov

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2731/27310203.htm

zbMATH Keywords

infinite games played on finite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 2077117
• Finite-state strategies in delay games
• Finite-state strategies in delay games
• scientific article; zbMATH DE number 4025193
• State-strategies for games in F_σδ ∩ G_δσ
• On players with a bounded number of states
• Infinite-state games with finitary conditions
• scientific article; zbMATH DE number 1531365
• Synthesis of finite-state and definable winning strategies
• One-counter stochastic games

Cited in

(11)

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Robot games with states in dimension one
• Finite-state strategies in delay games
• scientific article; zbMATH DE number 1810492 (Why is no real title available?)
• Finite-state strategies in delay games
• Memory Reduction for Strategies in Infinite Games
• scientific article; zbMATH DE number 1735822 (Why is no real title available?)
• scientific article; zbMATH DE number 2024632 (Why is no real title available?)
• Finite-memory strategies in two-player infinite games
• Playing Safe, Ten Years Later
• Deciding regular games: a playground for exponential time algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452102)