State Complexity of Combined Operations for Prefix-Free Regular Languages

被引：5
|
作者：
Han, Yo-Sub [1 ]
Salomaa, Kai [2 ]
Yu, Sheng [3 ]
机构：
[1] KIST, Intelligence & Interact Res Ctr, POB 131, Seoul, South Korea
[2] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
[3] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
来源：
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS | 2009年 / 5457卷
关键词：
BASIC OPERATIONS;
D O I：
10.1007/978-3-642-00982-2_34
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finite-state automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union. star-of-intersection, star-of-reversal and star-of-catenation.
引用
收藏
页码：398 / +
页数：3
相关论文
共 50 条
  • [1] Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Wood, Derick
    FUNDAMENTA INFORMATICAE, 2009, 90 (1-2) : 93 - 106
  • [2] Complexity in Prefix-Free Regular Languages
    Jiraskova, Galina
    Krausova, Monika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 197 - 204
  • [3] State Complexity of Boundary of Prefix-Free Regular Language
    Eom, Hae-Sung
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 697 - 707
  • [4] State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
    Eom, Hae-Sung
    Han, Yo-Sub
    Salomaa, Kai
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (02) : 211 - 227
  • [5] Kleene Closure on Regular and Prefix-Free Languages
    Jiraskova, Galina
    Palmovsky, Matus
    Sebej, Juraj
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014, 2014, 8587 : 226 - 237
  • [6] Prefix-free regular languages and pattern matching
    Han, Yo-Sub
    Wang, Yajun
    Wood, Derick
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 307 - 317
  • [7] A pumping lemma for regular closure of prefix-free languages
    Koga, Toshihiro
    INFORMATION AND COMPUTATION, 2022, 289
  • [8] State complexity of combined operations for suffix-free regular languages
    Eom, Hae-Sung
    Han, Yo-Sub
    THEORETICAL COMPUTER SCIENCE, 2013, 510 : 87 - 93
  • [9] Non-regular Maximal Prefix-Free Subsets of Regular Languages
    Jirasek, Jozef, Jr.
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 229 - 242
  • [10] The Boundary of Prefix-Free Languages
    Jirasek, Jozef
    Jiraskova, Galina
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 300 - 312
12345