On the state complexity of closures and interiors of regular languages with subwords and superwords

被引：9
|
作者：
Karandikar, P. [1 ,3 ]
Niewerth, M. [2 ]
Schnoebelen, Ph. [3 ]
机构：
[1] Chennai Math Inst, Chennai, Tamil Nadu, India
[2] Univ Bayreuth, Bayreuth, Germany
[3] CNRS, LSV, ENS Cachan, F-75700 Paris, France
来源：
THEORETICAL COMPUTER SCIENCE | 2016年 / 610卷
关键词：
Finite automata and regular languages; Subwords and superwords; State complexity; Combined operations; Closures and interiors of regular languages; SIZE; SETS;
D O I：
10.1016/j.tcs.2015.09.028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of L are obtained dually by collecting words having all their subwords and superwords in L, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interiors. We also consider the computational complexity of decision problems for closures of regular languages. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：91 / 107
页数：17
相关论文
共 50 条
  • [41] State Complexity of Kleene-Star Operations on Regular Tree Languages
    Han, Yo-Sub
    Ko, Sang-Ki
    Piao, Xiaoxue
    Salomaa, Kai
    ACTA CYBERNETICA, 2015, 22 (02): : 403 - 422
  • [42] PARTIAL ORDERS ON WORDS, MINIMAL ELEMENTS OF REGULAR LANGUAGES, AND STATE COMPLEXITY
    BIRGET, JC
    THEORETICAL COMPUTER SCIENCE, 1993, 119 (02) : 267 - 291
  • [43] State Complexity of Single-Word Pattern Matching in Regular Languages
    Brzozowski, Janusz A.
    Sylvie, Davies B.
    Madan, Abhishek
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2019, 2019, 11612 : 86 - 97
  • [44] 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 - +
  • [45] Ordering regular languages and automata: Complexity
    D'Agostino, Giovanna
    Martincigh, Davide
    Policriti, Alberto
    THEORETICAL COMPUTER SCIENCE, 2023, 949
  • [46] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 203 - 214
  • [47] Concatenation of Regular Languages and Descriptional Complexity
    Galina Jirásková
    Theory of Computing Systems, 2011, 49 : 306 - 318
  • [48] Complexity of topological properties of regular ω-languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : 197 - 217
  • [49] THE COMPLEXITY OF REGULAR DNLC GRAPH LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 40 (03) : 376 - 404
  • [50] RESTRICTING THE COMPLEXITY OF REGULAR DNLC LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 291 : 147 - 166
12345