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 language | English |
|---|---|
| Pages (from-to) | 965-979 |
| Number of pages | 15 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 27 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2016 Dec 1 |
Bibliographical note
Publisher Copyright:© 2016 World Scientific Publishing Company.
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)