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 条
  • [31] State Complexity of Unambiguous Operations on Deterministic Finite Automata
    Jiraskova, Galina
    Okhotin, Alexander
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 188 - 199
  • [32] State Complexity of Catenation Combined with Union and Intersection
    Cui, Bo
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 95 - 104
  • [33] State Complexity of Catenation Combined with Star and Reversal
    Cui, Bo
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 58 - 67
  • [34] State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
    Palioudakis, Alexandros
    Salomaa, Kai
    Akl, Selim G.
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 330 - 341
  • [35] State Complexity of Operations on Input-Driven Pushdown Automata
    Okhotin, Alexander
    Salomaa, Kai
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 485 - 496
  • [36] State complexity of operations on input-driven pushdown automata
    Okhotin, Alexander
    Salomaa, Kai
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 86 : 207 - 228
  • [37] On the state complexity of operations on two-way finite automata
    Jiraskova, Galina
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2017, 253 : 36 - 63
  • [38] State Complexity of Boolean Operations on Graph-Walking Automata
    Martynova, Olga
    Okhotin, Alexander
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [39] On the State Complexity of Operations on Two-Way Finite Automate
    Jiraskova, Galina
    Okhotin, Alexander
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 443 - +
  • [40] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 501 - +
12345