Operational State Complexity of Subtree-Free Regular Tree Languages-Reference-Cited by-同舟云学术

Operational State Complexity of Subtree-Free Regular Tree Languages

Published:2016-09 Issue:06 Volume:27 Page:705-724
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

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

Affiliation:

1. Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054116500246

Reference24 articles.

1. State complexity of power

2. State complexity of combined operations for suffix-free regular languages

3. State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

4. Estimation of state complexity of combined operations

5. State complexity of star of union and square of union on k regular languages

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. State Complexity of k-Parallel Tree Concatenation;Fundamenta Informaticae;2017-08-09