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 条
  • [21] Circuit complexity of regular languages
    Koucky, Michal
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 426 - 435
  • [22] Circuit Complexity of Regular Languages
    Koucky, Michal
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 865 - 879
  • [23] Combinatorial complexity of regular languages
    Shur, Arseny M.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 289 - 301
  • [24] Circuit Complexity of Regular Languages
    Michal Koucký
    Theory of Computing Systems, 2009, 45 : 865 - 879
  • [25] COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
    Brzozowski, Janusz
    Tamm, Hellis
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (07) : 1009 - 1027
  • [26] Energy complexity of regular languages
    Kiyak, Firat
    Say, A. C. Cem
    THEORETICAL COMPUTER SCIENCE, 2024, 982
  • [27] Quotient Complexity of Regular Languages
    Brzozowski, Janusz
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 17 - 28
  • [28] Derivation languages and descriptional complexity measures of restricted flat splicing systems
    Paul, Prithwineel
    Ray, Kumar Sankar
    THEORETICAL COMPUTER SCIENCE, 2020, 816 : 19 - 36
  • [29] From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity
    Gruber, Hermann
    Holzer, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1009 - 1040
  • [30] Consensual Definition of Languages by Regular Sets
    Reghizzi, Stefano Crespi
    Pietro, Pierluigi San
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 : 196 - 208
12345