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 条
  • [41] On the State Complexity of Complements, Stars, and Reversals of Regular Languages
    Jiraskova, Galina
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 431 - 442
  • [42] Estimation of state complexity of combined operations
    Esik, Zoltan
    Gao, Yuan
    Liu, Guangwu
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (35) : 3272 - 3280
  • [43] On the state complexity of combined operations and their estimation
    Salomaa, Kai
    Yu, Sheng
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (04) : 683 - 698
  • [44] State complexity of combined operations with two basic operations
    Cui, Bo
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2012, 437 : 82 - 102
  • [45] State complexity of GF(2)-operations on unary languages
    Okhotin, Alexander
    Sazhneva, Elizaveta
    INFORMATION AND COMPUTATION, 2022, 284
  • [46] State Complexity of Chop Operations on Unary and Finite Languages
    Holzer, Markus
    Jakobi, Sebastian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 169 - 182
  • [47] THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES
    Bassino, Frederique
    Giambruno, Laura
    Nicaud, Cyril
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (04) : 495 - 516
  • [48] On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
    Swernofsky, Joseph
    Wehar, Michael
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 414 - 426
  • [49] On the state complexity of closures and interiors of regular languages with subwords and superwords
    Karandikar, P.
    Niewerth, M.
    Schnoebelen, Ph.
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 91 - 107
  • [50] State Complexity of Suffix Distance
    Ng, Timothy
    Rappaport, David
    Salomaa, Kai
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 287 - 298
12345