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 条
  • [1] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2537 - 2548
  • [2] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 501 - +
  • [3] Nondeterministic State Complexity for Suffix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 189 - 196
  • [4] Complexity of suffix-free regular languages
    Brzozowski, Janusz A.
    Szykula, Marek
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 270 - 287
  • [5] Syntactic complexity of suffix-free languages
    Brzozowski, Janusz A.
    Szykula, Marek
    INFORMATION AND COMPUTATION, 2018, 259 : 174 - 190
  • [6] Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
    Brzozowski, Janusz A.
    Sinnamon, Corwin
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2017), 2017, 10168 : 171 - 182
  • [7] State Complexity of Combined Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Yu, Sheng
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 398 - +
  • [8] Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Wood, Derick
    FUNDAMENTA INFORMATICAE, 2009, 90 (1-2) : 93 - 106
  • [9] State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
    Pribavkina, Elena V.
    Rodaro, Emanuele
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 376 - +
  • [10] State complexity of some operations on binary regular languages
    Jirásková, G
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 287 - 298
12345