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 条
  • [41] Complexity in Union-Free Regular Languages
    Jiraskova, Galina
    Masopust, Tomas
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 255 - +
  • [42] Complexity of bifix-free regular languages
    Ferens, Robert
    Szykula, Marek
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 14 - 27
  • [43] Complexity of suffix-free regular languages
    Brzozowski, Janusz A.
    Szykula, Marek
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 270 - 287
  • [44] COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
    Jiraskova, Galina
    Masopust, Tomas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (07) : 1639 - 1653
  • [45] Non prefix-free codes for constrained sequences
    Dalai, M
    Leonardi, R
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 1534 - 1538
  • [46] Prefix-free parsing for building big BWTs
    Boucher, Christina
    Gagie, Travis
    Kuhnle, Alan
    Langmead, Ben
    Manzini, Giovanni
    Mun, Taher
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2019, 14 (1)
  • [47] Prefix-free parsing for building big BWTs
    Christina Boucher
    Travis Gagie
    Alan Kuhnle
    Ben Langmead
    Giovanni Manzini
    Taher Mun
    Algorithms for Molecular Biology, 14
  • [48] State complexity of combined operations
    Salomaa, Arto
    Salomaa, Kai
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 140 - 152
  • [49] Commutative Regular Languages - Properties and State Complexity
    Hoffmann, Stefan
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 151 - 163
  • [50] State complexity of binary coded regular languages
    Geffert, Viliam
    Palisinova, Dominika
    Szabari, Alexander
    THEORETICAL COMPUTER SCIENCE, 2024, 990
12345