Nondeterministic state complexity of nested word automata

被引：20
|
作者：
Han, Yo-Sub [2 ]
Salomaa, Kai [1 ]
机构：
[1] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
[2] Yonsei Univ, Dept Comp Sci, Seoul 120749, South Korea
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 30-32期
基金：
加拿大自然科学与工程研究理事会;
关键词：
State complexity; Nondeterminism; Finite automata on nested words; Language operations; REGULAR LANGUAGES; FINITE AUTOMATA; TRANSITION COMPLEXITY;
D O I：
10.1016/j.tcs.2009.01.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the nondeterministic state complexity of Boolean operations oil regular languages of nested words. For union and intersection we obtain matching upper and lower bounds. For complementation of a nondeterministic nested word automaton with n states we establish a lower bound Omega(root n!) that is significantly worse than the exponential lower bound for ordinary nondeterministic finite automata (NFA). We develop techniques to prove lower bounds for the size of nondeterministic nested word automata that extend the known techniques used for NFAs. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：2961 / 2971
页数：11
相关论文
共 50 条
  • [1] State Complexity of Nested Word Automata
    Salomaa, Kai
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 59 - 70
  • [2] Operational state complexity of nested word automata
    Piao, Xiaoxue
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (35) : 3290 - 3302
  • [3] Descriptional Complexity of Unambiguous Nested Word Automata
    Okhotin, Alexander
    Salomaa, Kai
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 414 - +
  • [4] State complexity of basic operations on nondeterministic finite automata
    Holzer, M
    Kutrib, M
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 148 - 157
  • [5] Descriptional complexity of nondeterministic finite automata
    Salomaa, Kai
    [J]. Developments in Language Theory, Proceedings, 2007, 4588 : 31 - 35
  • [6] State Complexity of Partial Word Finite Automata
    Kutrib, Martin
    Wendlandt, Matthias
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 113 - 124
  • [7] State Complexity of Union and Intersection for Two-Way Nondeterministic Finite Automata
    Kunc, Michal
    Okhotin, Alexander
    [J]. FUNDAMENTA INFORMATICAE, 2011, 110 (1-4) : 231 - 239
  • [8] Complexity of Unary Exclusive Nondeterministic Finite Automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [9] ON STATE MINIMIZATION OF NONDETERMINISTIC FINITE AUTOMATA
    KAMEDA, T
    WEINER, P
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (07) : 617 - &
  • [10] Nondeterministic finite automata - Recent results on the descriptional and computational complexity
    Holzer, Markus
    Kutrib, Martin
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 1 - +
12345