State complexity of regular tree languages for tree pattern matching

Sang Ki Ko, Ha Rim Lee, Yo-Sub Han

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

1 Citation (Scopus)

Abstract

We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occurrences. We also study the deterministic top-down state complexity of path-closed languages for the same problem.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings
PublisherSpringer Verlag
Pages246-257
Number of pages12
ISBN (Print)9783319097039
DOIs
Publication statusPublished - 2014 Jan 1
Event16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014 - Turku, Finland
Duration: 2014 Aug 52014 Aug 8

Publication series

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

Other

Other16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014
CountryFinland
CityTurku
Period14/8/514/8/8

Fingerprint

State Complexity
Pattern matching
Pattern Matching
Language
Concatenation
Matching Problem

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ko, S. K., Lee, H. R., & Han, Y-S. (2014). State complexity of regular tree languages for tree pattern matching. In Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings (pp. 246-257). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8614 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_22
Ko, Sang Ki ; Lee, Ha Rim ; Han, Yo-Sub. / State complexity of regular tree languages for tree pattern matching. Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings. Springer Verlag, 2014. pp. 246-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{969ad949fad84a1c95956652468c3743,
title = "State complexity of regular tree languages for tree pattern matching",
abstract = "We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occurrences. We also study the deterministic top-down state complexity of path-closed languages for the same problem.",
author = "Ko, {Sang Ki} and Lee, {Ha Rim} and Yo-Sub Han",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-09704-6_22",
language = "English",
isbn = "9783319097039",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "246--257",
booktitle = "Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings",
address = "Germany",

}

Ko, SK, Lee, HR & Han, Y-S 2014, State complexity of regular tree languages for tree pattern matching. in Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8614 LNCS, Springer Verlag, pp. 246-257, 16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014, Turku, Finland, 14/8/5. https://doi.org/10.1007/978-3-319-09704-6_22

State complexity of regular tree languages for tree pattern matching. / Ko, Sang Ki; Lee, Ha Rim; Han, Yo-Sub.

Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings. Springer Verlag, 2014. p. 246-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8614 LNCS).

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

TY - GEN

T1 - State complexity of regular tree languages for tree pattern matching

AU - Ko, Sang Ki

AU - Lee, Ha Rim

AU - Han, Yo-Sub

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occurrences. We also study the deterministic top-down state complexity of path-closed languages for the same problem.

AB - We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occurrences. We also study the deterministic top-down state complexity of path-closed languages for the same problem.

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

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

U2 - 10.1007/978-3-319-09704-6_22

DO - 10.1007/978-3-319-09704-6_22

M3 - Conference contribution

SN - 9783319097039

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

SP - 246

EP - 257

BT - Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings

PB - Springer Verlag

ER -

Ko SK, Lee HR, Han Y-S. State complexity of regular tree languages for tree pattern matching. In Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings. Springer Verlag. 2014. p. 246-257. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-09704-6_22