Advertisement

Theory of Computing Systems

, Volume 39, Issue 1, pp 237–276 | Cite as

Active Context-Free Games

  • Anca Muscholl
  • Thomas Schwentick
  • Luc Segoufin
Article

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. The complexity of deciding the existence of winning strategies for JULIET is investigated, depending on properties of the grammar and of the target language, and on restrictions on the strategy.

Keywords

Computational Mathematic Target Language Finite Alphabet Current Word Regular Target 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.LIAFA, Universite Paris VII, 2 place~Jussieu, F-75251 Paris Cedex 05France
  2. 2.FB Mathematik und Informatik, Philipps-Universitat Marburg, D-35032 MarburgGermany

Personalised recommendations