Winning Strategies for Streaming Rewriting Games
Pages 49 - 63
Abstract
Context-free games on strings are two-player rewriting games based on a set of production rules and a regular target language. In each round, the first player selects a position of the current string; then the second player replaces the symbol at that position according to one of the production rules. The first player wins as soon as the current string belongs to the target language. In this paper the one-pass setting for context-free games is studied, where the knowledge of the first player is incomplete: She selects positions in a left-to-right fashion and only sees the current symbol and the symbols from previous rounds. The paper studies conditions under which dominant and undominated strategies exist for the first player, and when they can be chosen from restricted types of strategies that can be computed efficiently.
References
[1]
Abiteboul S, Benjelloun O, and Milo T The active XML project: an overview VLDB J. 2008 17 5 1019-1040
[2]
Abiteboul, S., Bonifati, A., Cobéna, G., Manolescu, I., Milo, T.: Dynamic XML documents with distribution and replication. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 527–538. ACM (2003)
[3]
Abiteboul, S., Milo, T., Benjelloun, O.: Regular rewriting of active XML and unambiguity. In: PODS, pp. 295–303. ACM (2005)
[4]
Aminof B, Legay A, Murano A, Serre O, and Vardi MY Pushdown module checking with imperfect information Inf. Comput. 2013 223 1-17
[5]
Björklund, H., Schuster, M., Schwentick, T., Kulbatzki, J.: On optimum left-to-right strategies for active context-free games. In: Joint 2013 EDBT/ICDT Conferences, ICDT 2013 Proceedings, pp. 105–116 (2013)
[6]
Bozzelli Laura New results on pushdown module checking with imperfect information Electronic Proceedings in Theoretical Computer Science 2011 54 162-177
[7]
Cachat T Widmayer P, Eidenbenz S, Triguero F, Morales R, Conejo R, and Hennessy M Symbolic strategy synthesis for games on pushdown graphs Automata, Languages and Programming 2002 Heidelberg Springer 704-715
[8]
Coester, C.: One-pass strategies for context-free games. Master’s thesis, TU Dortmund (2015).
[9]
Coester, C., Schwentick, T., Schuster, M.: Streaming rewriting games: winning strategies and complexity. CoRR (2018). http://arxiv.org/abs/1804.10292
[10]
Holík, L., Meyer, R., Muskalla, S.: Summaries for context-free games. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India, 13–15 December 2016, pp. 41:1–41:16 (2016).
[11]
Milo T, Abiteboul S, Amann B, Benjelloun O, and Ngoc FD Exchanging intensional XML data ACM Trans. Database Syst. 2005 30 1 1-40
[12]
Schuster, M.: Transducer-based rewriting games for active XML. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, 22–26 August 2016, pp. 83:1–83:13 (2016).
[13]
Muscholl A, Schwentick T, and Segoufin L Diekert V and Habib M Active context-free games STACS 2004 2004 Heidelberg Springer 452-464
[14]
Muscholl A, Schwentick T, and Segoufin L Active context-free games Theory Comput. Syst. 2006 39 1 237-276
[15]
Schuster, M., Schwentick, T.: Games for active XML revisited. In: 18th International Conference on Database Theory, ICDT 2015, pp. 60–75 (2015)
[16]
Serre O Note on winning positions on pushdown games with [omega]-regular conditions Inf. Process. Lett. 2003 85 6 285-291
[17]
Walukiewicz I Pushdown processes: games and model-checking Inf. Comput. 2001 164 2 234-263
Recommendations
Efficient Winning Strategies in Random-Turn Maker-Breaker Games
We consider random-turn positional games, introduced by Peres, Schramm, Sheffield, and Wilson in 2007. A p-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin ...
Fast Winning Strategies in Avoider-Enforcer Games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. These types of problems were studied earlier for Maker-Breaker games; here ...
Winning strategies for aperiodic subtraction games
We provide a winning strategy for sums of games of Mark-t, an impartial game played on nonnegative integers where each move consists of subtraction by an integer between 1 and t-1 inclusive, or division by t, rounding down when necessary. Our algorithm ...
Comments
Information & Contributors
Information
Published In
Aug 2019
371 pages
ISBN:978-3-030-25026-3
DOI:10.1007/978-3-030-25027-0
© Springer Nature Switzerland AG 2019.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 12 August 2019
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025