State complexity of combined operations

被引：54
|
作者：
Salomaa, Arto
Salomaa, Kai
Yu, Sheng
机构：
[1] Turku Ctr Comp Sci, FIN-20520 Turku, Finland
[2] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
[3] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 383卷 / 2-3期
关键词：
state complexity; combined operations; regular languages;
D O I：
10.1016/j.tcs.2007.04.015
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the state complexity of combined operations. Two particular combined operations are studied: star of union and star of intersection. It is shown that the state complexity of a combined operation is not necessarily similar to the combination of the individual state complexities of the participating operations. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：140 / 152
页数：13
相关论文
共 50 条
  • [21] State complexity of unambiguous operations on finite automata
    Jiraskova, Galina
    Okhotin, Alexander
    THEORETICAL COMPUTER SCIENCE, 2019, 798 : 52 - 64
  • [22] State complexity of some operations on binary regular languages
    Jirásková, G
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 287 - 298
  • [23] State complexity of basic operations on nondeterministic finite automata
    Holzer, M
    Kutrib, M
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 148 - 157
  • [24] State complexity of GF(2)-operations on unary languages
    Okhotin, Alexander
    Sazhneva, Elizaveta
    INFORMATION AND COMPUTATION, 2022, 284
  • [25] State Complexity of Chop Operations on Unary and Finite Languages
    Holzer, Markus
    Jakobi, Sebastian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 169 - 182
  • [26] Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
    Sylvie Davies
    Theory of Computing Systems, 2018, 62 : 1952 - 2005
  • [27] Combination of roots and boolean operations: An application to state complexity
    Caron, Pascal
    Hamel-de le Court, Edwin
    Luque, Jean-Gabriel
    INFORMATION AND COMPUTATION, 2022, 289
  • [28] Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
    Davies, Sylvie
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (08) : 1952 - 2005
  • [29] A General Approach to State Complexity of Operations: Formalization and Limitations
    Davies, Sylvie
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 256 - 268
  • [30] THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES
    Bassino, Frederique
    Giambruno, Laura
    Nicaud, Cyril
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (04) : 495 - 516
12345