Concatenation of Regular Languages and Descriptional Complexity

被引：0
|
作者：
Galina Jirásková
机构：
[1] Slovak Academy of Sciences,Mathematical Institute
来源：
Theory of Computing Systems | 2011年 / 49卷
关键词：
Regular languages; Concatenation; State complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We investigate the deterministic and nondeterministic state complexity of languages resulting from the concatenation of two regular languages represented by deterministic and nondeterministic finite automata. We prove that the whole range of complexities up to the known upper bounds can be obtained in both cases.
引用
收藏
页码：306 / 318
页数：12
相关论文
共 50 条
  • [1] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 49 (02) : 306 - 318
  • [2] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 203 - 214
  • [3] Descriptional Complexity of Winning Sets of Regular Languages
    Marcus, Pierre
    Torma, Ilkka
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 130 - 141
  • [4] State complexity of the concatenation of regular tree languages
    Piao, Xiaoxue
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 429 : 273 - 281
  • [5] State complexity of concatenation and complementation of regular languages
    Jirásek, J
    Jirásková, G
    Szabari, A
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 178 - 189
  • [6] Regular languages, unambiguous concatenation and computational complexity
    Thérien, D
    [J]. FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 49 - 57
  • [7] REGULAR CHAIN CODE PICTURE LANGUAGES OF NONLINEAR DESCRIPTIONAL COMPLEXITY
    HINZ, F
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 414 - 421
  • [8] Descriptional Complexity of Deterministic Regular Expressions
    Losemann, Katja
    Martens, Wim
    Niewerth, Matthias
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 643 - 654
  • [9] Descriptional Complexity of Pushdown Store Languages
    Malcher, Andreas
    Meckel, Katja
    Mereghetti, Carlo
    Palano, Beatrice
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 209 - 221
  • [10] RECENT TRENDS IN DESCRIPTIONAL COMPLEXITY OF FORMAL LANGUAGES
    Pighizzini, Giovanni
    Kutrib, Martin
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2013, (111): : 69 - 86
12345