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 条
  • [21] Prefix-free languages: Left and right quotient and reversal
    Jirasek, Jozef
    Jiraskova, Galina
    Krausova, Monika
    Mlynarcik, Peter
    Sebej, Juraj
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 78 - 90
  • [22] Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
    Bauwens, Bruno
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 100 - 108
  • [23] State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
    Pribavkina, Elena V.
    Rodaro, Emanuele
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 376 - +
  • [24] State complexity of some operations on binary regular languages
    Jirásková, G
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 287 - 298
  • [25] Prefix-free languages and initial segments of computably enumerable degrees
    Wu, GH
    COMPUTING AND COMBINATORICS, 2001, 2108 : 576 - 585
  • [26] Complexity of proper prefix-convex regular languages
    Brzozowski, Janusz A.
    Sinnamon, Corwin
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 2 - 13
  • [27] Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
    Jiraskova, Galina
    Mlynarcik, Peter
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 222 - 233
  • [28] 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
  • [29] 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
  • [30] On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
    Martijn Baartse
    George Barmpalias
    Theory of Computing Systems, 2013, 52 : 28 - 47
12345