State complexity of subtree-free regular tree languages

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We introduce subtree-free regular tree languages that often appear in 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
Title of host publicationDescriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings
Pages66-77
Number of pages12
DOIs
Publication statusPublished - 2013 Sep 26
Event15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013 - London, ON, Canada
Duration: 2013 Jul 222013 Jul 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8031 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013
CountryCanada
CityLondon, ON
Period13/7/2213/7/25

Fingerprint

State Complexity
XML
Stars
Tree Automata
XML Schema
Concatenation
Bottom-up
Star
Union
Intersection
Language
Sufficient
Necessary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Eom, H. S., Han, Y-S., & Ko, S. K. (2013). State complexity of subtree-free regular tree languages. In Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings (pp. 66-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8031 LNCS). https://doi.org/10.1007/978-3-642-39310-5_8
Eom, Hae Sung ; Han, Yo-Sub ; Ko, Sang Ki. / State complexity of subtree-free regular tree languages. Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings. 2013. pp. 66-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{527b79494a604208bb9025c1ce21aed7,
title = "State complexity of subtree-free regular tree languages",
abstract = "We introduce subtree-free regular tree languages that often appear in 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 = "Eom, {Hae Sung} and Yo-Sub Han and Ko, {Sang Ki}",
year = "2013",
month = "9",
day = "26",
doi = "10.1007/978-3-642-39310-5_8",
language = "English",
isbn = "9783642393099",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "66--77",
booktitle = "Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings",

}

Eom, HS, Han, Y-S & Ko, SK 2013, State complexity of subtree-free regular tree languages. in Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8031 LNCS, pp. 66-77, 15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013, London, ON, Canada, 13/7/22. https://doi.org/10.1007/978-3-642-39310-5_8

State complexity of subtree-free regular tree languages. / Eom, Hae Sung; Han, Yo-Sub; Ko, Sang Ki.

Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings. 2013. p. 66-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8031 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - State complexity of subtree-free regular tree languages

AU - Eom, Hae Sung

AU - Han, Yo-Sub

AU - Ko, Sang Ki

PY - 2013/9/26

Y1 - 2013/9/26

N2 - We introduce subtree-free regular tree languages that often appear in 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 often appear in 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=84884474871&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-642-39310-5_8

DO - 10.1007/978-3-642-39310-5_8

M3 - Conference contribution

SN - 9783642393099

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 66

EP - 77

BT - Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings

ER -

Eom HS, Han Y-S, Ko SK. State complexity of subtree-free regular tree languages. In Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings. 2013. p. 66-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-39310-5_8