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 条
  • [1] On the State Complexity of Closures and Interiors of Regular Languages with Subwords
    Karandikar, Prateek
    Schnoebelen, Philippe
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 234 - 245
  • [2] Counting Subwords and Regular Languages
    Colbourn, Charles J.
    Dougherty, Ryan E.
    Lidbetter, Thomas F.
    Shallit, Jeffrey
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 231 - 242
  • [3] The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages
    Rampersad, Narad
    Shallit, Jeffrey
    Xu, Zhi
    FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 223 - 236
  • [4] On the state complexity of reversals of regular languages
    Salomaa, A
    Wood, D
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 315 - 329
  • [5] Separability by piecewise testable languages and downward closures beyond subwords
    Zetzsche, Georg
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 929 - 938
  • [6] Commutative Regular Languages - Properties and State Complexity
    Hoffmann, Stefan
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 151 - 163
  • [7] State complexity of binary coded regular languages
    Geffert, Viliam
    Palisinova, Dominika
    Szabari, Alexander
    THEORETICAL COMPUTER SCIENCE, 2024, 990
  • [8] INTERSECTION AND UNION OF REGULAR LANGUAGES AND STATE COMPLEXITY
    BIRGET, JC
    INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 185 - 190
  • [9] 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
  • [10] State complexity of pattern matching in regular languages
    Brzozowski, Janusz A.
    Davies, Sylvie
    Madan, Abhishek
    THEORETICAL COMPUTER SCIENCE, 2019, 777 : 121 - 131
12345