Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

STACS
2004
Springer

favoriteEmaildiscussreport

189views Theoretical Computer Science» more STACS 2004»

Active Context-Free Games

13 years 9 months ago

Active Context-Free Games

Download ls1-www.cs.uni-dortmund.de

An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a ﬁnite 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, of the target language, and on restrictions on the strategy.

Anca Muscholl, Thomas Schwentick, Luc Segoufin

Real-time Traffic

Active Context-Free Game | Regular Target Language | STACS 2004 | Target Language | Theoretical Computer Science |

claim paper

Related Content

» Recognition of Composite Human Activities through ContextFree Grammar Based Representation

» Refined activation strategy for the marking game

» Classifying input for active games

» Designing games to motivate physical activity

» Physical activity motivating games virtual rewards for real activity

» The VoodooIO gaming kit a realtime adaptable gaming controller

» The Ethics of Computer Game Design

» From MITO to SAMO Evolution of an Educational Game for Spanish Orthography

» The application of IMS Learning Design to Develop Computebased Educational Game

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Anca Muscholl, Thomas Schwentick, Luc Segoufin

Comments (0)