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 条
  • [31] ON EQUALITY OF MULTIPLICITY SETS OF REGULAR LANGUAGES
    RUOHONEN, K
    THEORETICAL COMPUTER SCIENCE, 1985, 36 (01) : 113 - 117
  • [32] REPRESENTATION OF REGULAR LANGUAGES BY EQUALITY SETS
    Halava, Vesa
    Harju, Tero
    Latteux, Michel
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (86): : 224 - 228
  • [33] Ordering regular languages and automata: Complexity
    D'Agostino, Giovanna
    Martincigh, Davide
    Policriti, Alberto
    THEORETICAL COMPUTER SCIENCE, 2023, 949
  • [34] On the state complexity of reversals of regular languages
    Salomaa, A
    Wood, D
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 315 - 329
  • [35] Complexity of topological properties of regular ω-languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : 197 - 217
  • [36] THE COMPLEXITY OF REGULAR DNLC GRAPH LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 40 (03) : 376 - 404
  • [37] RESTRICTING THE COMPLEXITY OF REGULAR DNLC LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 291 : 147 - 166
  • [38] Boolean Circuit Complexity of Regular Languages
    Valdats, Maris
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 342 - 354
  • [39] Complexity of Topological Properties of Regular ω-Languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 529 - +
  • [40] From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity
    Gruber, Hermann
    Holzer, Markus
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 25 - 48
12345