Nondeterministic state complexity of nested word automata

Yo Sub Han; Kai Salomaa

doi:10.1016/j.tcs.2009.01.004

Nondeterministic state complexity of nested word automata

Yo Sub Han, Kai Salomaa

College of Computing

Research output: Contribution to journal › Article › peer-review

21 Citations (Scopus)

Abstract

We study the nondeterministic state complexity of Boolean operations on 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 Ω (sqrt(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.

Original language	English
Pages (from-to)	2961-2971
Number of pages	11
Journal	Theoretical Computer Science
Volume	410
Issue number	30-32
DOIs	https://doi.org/10.1016/j.tcs.2009.01.004
Publication status	Published - 2009 Aug 20

Bibliographical note

Funding Information:
The first author’s research supported in part by the IT R&D program of MKE/IITA 2008-S-024-01 and the KRCF research grant. The second author’s research supported in part by the Natural Sciences and Engineering Research Council of Canada.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2009.01.004

Cite this

@article{e50df85ee7f84920b474f459da769bfb,

title = "Nondeterministic state complexity of nested word automata",

abstract = "We study the nondeterministic state complexity of Boolean operations on 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 Ω (sqrt(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.",

author = "Han, {Yo Sub} and Kai Salomaa",

note = "Funding Information: The first author{\textquoteright}s research supported in part by the IT R&D program of MKE/IITA 2008-S-024-01 and the KRCF research grant. The second author{\textquoteright}s research supported in part by the Natural Sciences and Engineering Research Council of Canada.",

year = "2009",

month = aug,

day = "20",

doi = "10.1016/j.tcs.2009.01.004",

language = "English",

volume = "410",

pages = "2961--2971",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "30-32",

}

TY - JOUR

T1 - Nondeterministic state complexity of nested word automata

AU - Han, Yo Sub

AU - Salomaa, Kai

N1 - Funding Information: The first author’s research supported in part by the IT R&D program of MKE/IITA 2008-S-024-01 and the KRCF research grant. The second author’s research supported in part by the Natural Sciences and Engineering Research Council of Canada.

PY - 2009/8/20

Y1 - 2009/8/20

N2 - We study the nondeterministic state complexity of Boolean operations on 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 Ω (sqrt(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.

AB - We study the nondeterministic state complexity of Boolean operations on 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 Ω (sqrt(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.

UR - http://www.scopus.com/inward/record.url?scp=67649639497&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649639497&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.01.004

DO - 10.1016/j.tcs.2009.01.004

M3 - Article

AN - SCOPUS:67649639497

SN - 0304-3975

VL - 410

SP - 2961

EP - 2971

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 30-32

ER -

Nondeterministic state complexity of nested word automata

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this