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 条
  • [31] Quotient Complexity of Regular Languages
    Brzozowski, Janusz
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 17 - 28
  • [32] Recognizing pro-R closures of regular languages
    Almeida, Jorge
    Costa, Jose Carlos
    Zeitoun, Marc
    FORUM MATHEMATICUM, 2022, 34 (05) : 1131 - 1145
  • [33] State Complexity of Basic Operations on Non-Returning Regular Languages
    Eom, Hae-Sung
    Han, Yo-Sub
    Jiraskova, Galina
    FUNDAMENTA INFORMATICAE, 2016, 144 (02) : 161 - 182
  • [34] State complexity of combined operations for suffix-free regular languages
    Eom, Hae-Sung
    Han, Yo-Sub
    THEORETICAL COMPUTER SCIENCE, 2013, 510 : 87 - 93
  • [35] Operational State Complexity of Subtree-Free Regular Tree Languages
    Ko, Sang-Ki
    Eom, Hae-Sung
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (06) : 705 - 724
  • [36] 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 - +
  • [37] State complexity of union and intersection of square and reversal on k regular languages
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2012, 454 : 164 - 171
  • [38] State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
    Pribavkina, Elena V.
    Rodaro, Emanuele
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 376 - +
  • [39] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2537 - 2548
  • [40] State complexity of star of union and square of union on k regular languages
    Gao, Yuan
    Kari, Lila
    THEORETICAL COMPUTER SCIENCE, 2013, 499 : 38 - 50
12345