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 条
  • [21] State Complexity of Star and Square of Union of k Regular Languages
    Gao, Yuan
    Kari, Lila
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 155 - 168
  • [22] State Complexity of Regular Tree Languages for Tree Pattern Matching
    Ko, Sang-Ki
    Lee, Ha-Rim
    Han, Yo-Sub
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 246 - 257
  • [23] State complexity of union and intersection of star on k regular languages
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 98 - 107
  • [24] Nondeterministic State Complexity for Suffix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 189 - 196
  • [25] Circuit complexity of regular languages
    Koucky, Michal
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 426 - 435
  • [26] Circuit Complexity of Regular Languages
    Koucky, Michal
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 865 - 879
  • [27] Combinatorial complexity of regular languages
    Shur, Arseny M.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 289 - 301
  • [28] Circuit Complexity of Regular Languages
    Michal Koucký
    Theory of Computing Systems, 2009, 45 : 865 - 879
  • [29] COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
    Brzozowski, Janusz
    Tamm, Hellis
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (07) : 1009 - 1027
  • [30] Energy complexity of regular languages
    Kiyak, Firat
    Say, A. C. Cem
    THEORETICAL COMPUTER SCIENCE, 2024, 982
12345