2016
DOI: 10.4230/lipics.fsttcs.2016.41
|View full text |Cite
|
Sign up to set email alerts
|

Summaries for Context-Free Games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The article studies the decidability and complexity of deciding whether a winning unrestricted or left-to-right strategy exists for a word in the general case and several restricted cases. More recently, Holík et al gave a new algorithm for determining the winner of a left-to-right context-free game and determining a winning strategy [10]. One-pass strategies and (forgetful) regular strategies were introduced in [3].…”
Section: Related Workmentioning
confidence: 99%
“…The article studies the decidability and complexity of deciding whether a winning unrestricted or left-to-right strategy exists for a word in the general case and several restricted cases. More recently, Holík et al gave a new algorithm for determining the winner of a left-to-right context-free game and determining a winning strategy [10]. One-pass strategies and (forgetful) regular strategies were introduced in [3].…”
Section: Related Workmentioning
confidence: 99%