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 条
12345