Operational State Complexity of Subtree-Free Regular Tree Languages

Sang Ki Ko, Hae Sung Eom, Yo-Sub Han

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We introduce subtree-free regular tree languages that are closely related to XML schemas and investigate the state complexity of basic operations on subtree-free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages.

Original languageEnglish
Pages (from-to)705-724
Number of pages20
JournalInternational Journal of Foundations of Computer Science
Volume27
Issue number6
DOIs
Publication statusPublished - 2016 Sep 1

Fingerprint

XML
Stars

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@article{0264b76493c44f6986076d1a913d4b10,
title = "Operational State Complexity of Subtree-Free Regular Tree Languages",
abstract = "We introduce subtree-free regular tree languages that are closely related to XML schemas and investigate the state complexity of basic operations on subtree-free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages.",
author = "Ko, {Sang Ki} and Eom, {Hae Sung} and Yo-Sub Han",
year = "2016",
month = "9",
day = "1",
doi = "10.1142/S0129054116500246",
language = "English",
volume = "27",
pages = "705--724",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "6",

}

Operational State Complexity of Subtree-Free Regular Tree Languages. / Ko, Sang Ki; Eom, Hae Sung; Han, Yo-Sub.

In: International Journal of Foundations of Computer Science, Vol. 27, No. 6, 01.09.2016, p. 705-724.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Operational State Complexity of Subtree-Free Regular Tree Languages

AU - Ko, Sang Ki

AU - Eom, Hae Sung

AU - Han, Yo-Sub

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We introduce subtree-free regular tree languages that are closely related to XML schemas and investigate the state complexity of basic operations on subtree-free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages.

AB - We introduce subtree-free regular tree languages that are closely related to XML schemas and investigate the state complexity of basic operations on subtree-free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages.

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

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

U2 - 10.1142/S0129054116500246

DO - 10.1142/S0129054116500246

M3 - Article

VL - 27

SP - 705

EP - 724

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -