Abstract
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo rewrites the corresponding letter according to a rule of a context-free grammar. Juliet wins if a string of the regular target language is reached. We consider the complexity of deciding winning strategies for Juliet depending on properties of the grammar, of the target language, and on restrictions on the strategy.
Work supported by the DAAD and Egide under PROCOPE grant D/0205766.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S.: Semistructured Data: from Practice to Theory. In: LICS 2001, IEEE Comp. Soc., Los Alamitos (2001)
Abiteboul, S., Bonifati, A., Cobena, G., Manolescu, I., Milo, T.: Dynamic XML documents with distribution and replication. In: SIGMOD 2003, pp. 527–538. ACM, New York (2003)
Active XML, http://www-rocq.inria.fr/verso/Gemo/Projects/axml
Blumensath, A., Grädel, E.: Automatic structures. In: LICS 2000, pp. 51–62. IEEE Comp. Soc., Los Alamitos (2000)
Cachat, T.: Symbolic Strategy Synthesis for Games on Pushdown Graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 704–715. Springer, Heidelberg (2002)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. Springer, Heidelberg (2002)
Jelly: Executable XML, http://jakarta.apache.org/commons/sandbox/jelly
Löding, C.: Infinite graphs generated by tree rewriting. PhD thesis, RWTH Aachen (2003)
Macromedia Coldfusion MX, http://www.macromedia.com/
Mayr, R.: Process rewrite systems. Theoretical computer science 156(1-2), 264–286 (2000)
Milo, T., Abiteboul, S., Amann, B., Benjelloun, O., Dang Ngoc, F.: Exchanging Intensional XML Data. In: SIGMOD 2003, pp. 289–300. ACM, New York (2003)
Neven, F.: Automata, Logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Papadimitriou, C.: Computational complexity. Addison-Wesley, Reading (1994)
Serre, O.: Note on winning positions on pushdown games with ω-regular conditions. Information Processing Letters 85, 285–291 (2003)
Vianu, V.: A Web Odyssey: From Codd to XML. In: PODS 2001, ACM, New York (2001)
Walukiewicz, I.: Pushdown Processes: Games and Model-Checking. Information and Computation 164(2), 234–263 (2001)
Web services, http://www.w3.org/2002/ws
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muscholl, A., Schwentick, T., Segoufin, L. (2004). Active Context-Free Games. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive