Conference item icon

Conference item

Winning strategies for streaming rewriting games

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 ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-030-25027-0_4

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
St Anne's College
Role:
Author
ORCID:
0000-0003-3744-0977
Publisher:
Springer
Host title:
Fundamentals of Computation Theory. FCT 2019
Series:
Lecture Notes in Computer Science
Series number:
11651
Pages:
49-63
Place of publication:
Cham, Switzerland
Publication date:
2019-07-10
Event title:
22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)
Event location:
Copenhagen, Denmark
Event start date:
2019-08-12
Event end date:
2019-08-14
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
EISBN:
9783030250270
ISBN:
9783030250263
Language:
English
Keywords:
Pubs id:
1278426
Local pid:
pubs:1278426
Deposit date:
2023-03-28

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP