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 条
  • [31] On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
    Baartse, Martijn
    Barmpalias, George
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (01) : 28 - 47
  • [32] Universal computably enumerable sets and initial segment prefix-free complexity
    Barmpalias, George
    INFORMATION AND COMPUTATION, 2013, 233 : 41 - 59
  • [33] Nondeterministic State Complexity for Suffix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 189 - 196
  • [34] The structure of optimal prefix-free codes in restricted languages: The uniform probability case
    Golin, MJ
    Liu, ZM
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 372 - 384
  • [35] The state complexity of language operations on XNFA-succinct unary regular languages
    Marais, Laurette
    van Zijl, Lynette
    PROCEEDINGS OF THE ANNUAL CONFERENCE OF THE SOUTH AFRICAN INSTITUTE OF COMPUTER SCIENTISTS AND INFORMATION TECHNOLOGISTS (SAICSIT 2018), 2018, : 20 - 28
  • [36] Universality probability of a prefix-free machine
    Barmpalias, George
    Dowe, David L.
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2012, 370 (1971): : 3488 - 3511
  • [37] Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
    Brzozowski, Janusz
    Li, Baiyu
    Ye, Yuli
    THEORETICAL COMPUTER SCIENCE, 2012, 449 : 37 - 53
  • [38] On the state complexity of reversals of regular languages
    Salomaa, A
    Wood, D
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 315 - 329
  • [39] 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
  • [40] Prefix-Free and Prefix-Correct Complexities with Compound Conditions
    Kalinina, Elena
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 259 - 265
12345