State complexity of combined operations for suffix-free regular languages

被引：2
|
作者：
Eom, Hae-Sung [1 ]
Han, Yo-Sub [1 ]
机构：
[1] Yonsei Univ, Dept Comp Sci, Seoul 120749, South Korea
来源：
THEORETICAL COMPUTER SCIENCE | 2013年 / 510卷
关键词：
State complexity; Suffix-free regular languages; Combined operations; BASIC OPERATIONS; INTERSECTION; REVERSAL; UNION;
D O I：
10.1016/j.tcs.2013.09.014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：87 / 93
页数：7
相关论文
共 50 条
  • [31] State Complexity of Binary Coded Regular Languages
    Geffert, Viliam
    Palisinova, Dominika
    Szabari, Alexander
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 72 - 84
  • [32] State complexity of the concatenation of regular tree languages
    Piao, Xiaoxue
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 273 - 281
  • [33] Operations on Subregular Languages and Nondeterministic State Complexity
    Hospodar, Michal
    Mlynarcik, Peter
    Olejar, Viktor
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 112 - 126
  • [34] Undecidability of the State Complexity of Composed Regular Operations
    Salomaa, Arto
    Salomaa, Kai
    Yu, Sheng
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 489 - +
  • [35] Syntactic complexity of bifix-free regular languages
    Szykula, Marek
    Wittnebel, John
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 45 - 76
  • [36] THE STATE COMPLEXITIES OF SOME BASIC OPERATIONS ON REGULAR LANGUAGES
    YU, S
    ZHUANG, QY
    SALOMAA, K
    THEORETICAL COMPUTER SCIENCE, 1994, 125 (02) : 315 - 328
  • [37] State Complexity of Regular Tree Languages for Tree Matching
    Ko, Sang-Ki
    Lee, Ha-Rim
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (08) : 965 - 979
  • [38] On a structural property in the state complexity of projected regular languages
    Jiraskova, Galina
    Masopust, Tomas
    THEORETICAL COMPUTER SCIENCE, 2012, 449 : 93 - 105
  • [39] On the State Complexity of Closures and Interiors of Regular Languages with Subwords
    Karandikar, Prateek
    Schnoebelen, Philippe
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 234 - 245
  • [40] Finite Transducers and Nondeterministic State Complexity of Regular Languages
    Povarov, G. A.
    RUSSIAN MATHEMATICS, 2010, 54 (06) : 19 - 25
12345