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 条
  • [21] Complexity of bifix-free regular languages
    Ferens, Robert
    Szykula, Marek
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 14 - 27
  • [22] Complexity in Prefix-Free Regular Languages
    Jiraskova, Galina
    Krausova, Monika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 197 - 204
  • [23] COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
    Jiraskova, Galina
    Masopust, Tomas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (07) : 1639 - 1653
  • [24] State complexity of combined operations
    Salomaa, Arto
    Salomaa, Kai
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 140 - 152
  • [25] Commutative Regular Languages - Properties and State Complexity
    Hoffmann, Stefan
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 151 - 163
  • [26] State complexity of binary coded regular languages
    Geffert, Viliam
    Palisinova, Dominika
    Szabari, Alexander
    THEORETICAL COMPUTER SCIENCE, 2024, 990
  • [27] INTERSECTION AND UNION OF REGULAR LANGUAGES AND STATE COMPLEXITY
    BIRGET, JC
    INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 185 - 190
  • [28] On the state complexity of combined operations
    Yu, Sheng
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 4094 : 11 - 22
  • [29] State complexity of concatenation and complementation of regular languages
    Jirásek, J
    Jirásková, G
    Szabari, A
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 178 - 189
  • [30] State complexity of pattern matching in regular languages
    Brzozowski, Janusz A.
    Davies, Sylvie
    Madan, Abhishek
    THEORETICAL COMPUTER SCIENCE, 2019, 777 : 121 - 131
12345