Descriptional Complexity of Winning Sets of Regular Languages

被引：1
|
作者：
Marcus, Pierre [1 ]
Torma, Ilkka [2 ]
机构：
[1] Ecole Normale Super Lyon, Informat Fondamentale M2, Lyon, France
[2] Univ Turku, Dept Math & Stat, Turku, Finland
来源：
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020 | 2020年 / 12442卷
基金：
芬兰科学院;
关键词：
State complexity; Regular languages; Winning sets;
D O I：
10.1007/978-3-030-62536-8_11
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target language. The turn orders that result in a win for Alice form a binary language that is regular whenever the target language is, and we prove some upper and lower bounds for its state complexity based on that of the target language.
引用
收藏
页码：130 / 141
页数：12
相关论文
共 50 条
  • [1] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (02) : 306 - 318
  • [2] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 203 - 214
  • [3] Concatenation of Regular Languages and Descriptional Complexity
    Galina Jirásková
    Theory of Computing Systems, 2011, 49 : 306 - 318
  • [4] REGULAR CHAIN CODE PICTURE LANGUAGES OF NONLINEAR DESCRIPTIONAL COMPLEXITY
    HINZ, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 414 - 421
  • [5] Descriptional Complexity of Deterministic Regular Expressions
    Losemann, Katja
    Martens, Wim
    Niewerth, Matthias
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 643 - 654
  • [6] Descriptional Complexity of Pushdown Store Languages
    Malcher, Andreas
    Meckel, Katja
    Mereghetti, Carlo
    Palano, Beatrice
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 209 - 221
  • [7] On the Descriptional Complexity of Operations on Semilinear Sets
    Beier, Simon
    Holzer, Markus
    Kutrib, Martin
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (252): : 41 - 55
  • [8] Closure properties and complexity of rational sets of regular languages
    Holzer, Andreas
    Schallhart, Christian
    Tautschnig, Michael
    Veith, Helmut
    THEORETICAL COMPUTER SCIENCE, 2015, 605 : 62 - 79
  • [9] RECENT TRENDS IN DESCRIPTIONAL COMPLEXITY OF FORMAL LANGUAGES
    Pighizzini, Giovanni
    Kutrib, Martin
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2013, (111): : 69 - 86
  • [10] On the undecidability and descriptional complexity of synchronized regular expressions
    Xie, Jingnan
    Hunt, Harry B. B.
    ACTA INFORMATICA, 2023, 60 (03) : 257 - 278
12345