Abstract
Two topics are presented: synchronization games and synchronization costs. In a synchronization game on a deterministic finite automaton, there are two players, Alice and Bob, whose moves alternate. Alice wants to synchronize the given automaton, while Bob aims to make her task as hard as possible. We answer a few natural questions related to such games. Speaking about synchronization costs, we consider deterministic automata in which each transition has a certain price. The problem is whether or not a given automaton can be synchronized within a given budget. We determine the complexity of this problem. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Fominykh, F., & Volkov, M. (2012). P(l)aying for synchronization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 159–170). https://doi.org/10.1007/978-3-642-31606-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
