Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Gelderie, Marcus"'
Publikováno v:
Procedia Computer Science; 2024, Vol. 246, p3148-3157, 10p
Autor:
Chaturvedi, Namit, Gelderie, Marcus
Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are "linearizations" of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the latter. In this
Externí odkaz:
http://arxiv.org/abs/1402.3199
Autor:
Gelderie, Marcus, Holtmann, Michael
Publikováno v:
EPTCS 50, 2011, pp. 46-60
We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite games (i.e., controllers that ensure correct behavior against actions of t
Externí odkaz:
http://arxiv.org/abs/1102.4120
Autor:
Chaturvedi, Namit, Gelderie, Marcus
Publikováno v:
In Information and Computation October 2017 256:23-34
Autor:
Gelderie, Marcus
Publikováno v:
Aachen II, 195 S. : graph. Darst. (2014). = Aachen, Techn. Hochsch., Diss., 2014
This thesis studies the representation of winning strategies in infinite games as Turing machines. We show that Turing-machine-based strategy representation (by "strategy machines") - if compared to the standard setting of Mealy automata - allows for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::ab54e149daf809f61435ad47da5a974f
Autor:
Chaturvedi, Namit, Gelderie, Marcus
Publikováno v:
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I; 2014, p171-182, 12p
Autor:
Gelderie, Marcus
Publikováno v:
Automata, Languages & Programming (9783642392115); 2013, p263-274, 12p
Autor:
Gelderie, Marcus
Publikováno v:
Mathematical Foundations of Computer Science 2012; 2012, p431-442, 12p