Nondeterministic state complexity of nested word automata

Yo-Sub Han, Kai Salomaa

Research output: Contribution to journalArticle

20 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 languageEnglish
Pages (from-to)2961-2971
Number of pages11
JournalTheoretical Computer Science
Volume410
Issue number30-32
DOIs
Publication statusPublished - 2009 Aug 20

Fingerprint

State Complexity
Formal languages
Finite automata
Automata
Lower bound
Boolean Operation
Complementation
Regular Languages
Finite Automata
Upper and Lower Bounds
Union
Intersection

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Yo-Sub ; Salomaa, Kai. / Nondeterministic state complexity of nested word automata. In: Theoretical Computer Science. 2009 ; Vol. 410, No. 30-32. pp. 2961-2971.
@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 = "Yo-Sub Han and Kai Salomaa",
year = "2009",
month = "8",
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",

}

Nondeterministic state complexity of nested word automata. / Han, Yo-Sub; Salomaa, Kai.

In: Theoretical Computer Science, Vol. 410, No. 30-32, 20.08.2009, p. 2961-2971.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Nondeterministic state complexity of nested word automata

AU - Han, Yo-Sub

AU - Salomaa, Kai

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

VL - 410

SP - 2961

EP - 2971

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 30-32

ER -