Active context-free games

被引：3
|
作者：
Muscholl, A
Schwentick, T
Segoufin, L
机构：
[1] Univ Paris 07, LIAFA, F-75251 Paris 05, France
[2] Univ Marburg, FB Math & Informat, D-35032 Marburg, Germany
[3] Parc Club Orsay Univ, INRIA, ZAC Vignes, F-91893 Orsay, France
来源：
THEORY OF COMPUTING SYSTEMS | 2006年 / 39卷 / 01期
关键词：
Computational Mathematic; Target Language; Finite Alphabet; Current Word; Regular Target;
D O I：
10.1007/s00224-005-1278-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：237 / 276
页数：40
相关论文
共 50 条
12345