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 条
  • [41] Descriptional Complexity of Biautomata
    Jiraskova, Galina
    Klima, Ondrej
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 196 - 208
  • [42] COMPLEXITY OF SKEWLINEAR TUPLE LANGUAGES AND O-REGULAR LANGUAGES
    KUICH, W
    INFORMATION AND CONTROL, 1971, 19 (04): : 353 - &
  • [43] COMPLEXITY OF MINIMUM INFERENCE OF REGULAR SETS
    ANGLUIN, D
    INFORMATION AND CONTROL, 1978, 39 (03): : 337 - 350
  • [44] Complexity in Union-Free Regular Languages
    Jiraskova, Galina
    Masopust, Tomas
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 255 - +
  • [45] Commutative Regular Languages - Properties and State Complexity
    Hoffmann, Stefan
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 151 - 163
  • [46] Complexity of suffix-free regular languages
    Brzozowski, Janusz A.
    Szykula, Marek
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 270 - 287
  • [47] State complexity of binary coded regular languages
    Geffert, Viliam
    Palisinova, Dominika
    Szabari, Alexander
    THEORETICAL COMPUTER SCIENCE, 2024, 990
  • [48] INTERSECTION AND UNION OF REGULAR LANGUAGES AND STATE COMPLEXITY
    BIRGET, JC
    INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 185 - 190
  • [49] Complexity of bifix-free regular languages
    Ferens, Robert
    Szykula, Marek
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 14 - 27
  • [50] Complexity of aperiodicity for topological properties of regular ω-languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    LOGIC AND THEORY OF ALGORITHMS, 2008, 5028 : 533 - +
12345