State complexity of Kleene-star operations on regular tree languages

Yo-Sub Han, Sang Ki Ko, Xiaoxue Piao, Kai Salomaa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. We establish that the worst-case state complexity of bottom-up star is (n + 3/2) · 2n-1. The bound differs by an order of magnitude from the corresponding result for string languages. The state complexity of top-down star is similar as in the string case. We consider also the state complexity of the star of the concatenation of a regular tree language with the set of all trees.

Original languageEnglish
Pages (from-to)403-422
Number of pages20
JournalActa Cybernetica
Volume22
Issue number2
DOIs
Publication statusPublished - 2015 Jan 1

Fingerprint

Star Operation
State Complexity
Concatenation
Stars
Star
Bottom-up
Strings
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Computer Science (miscellaneous)
  • Computer Vision and Pattern Recognition
  • Management Science and Operations Research
  • Information Systems and Management
  • Electrical and Electronic Engineering

Cite this

Han, Yo-Sub ; Ko, Sang Ki ; Piao, Xiaoxue ; Salomaa, Kai. / State complexity of Kleene-star operations on regular tree languages. In: Acta Cybernetica. 2015 ; Vol. 22, No. 2. pp. 403-422.
@article{124f79f63ca642e587e5cea7f74d4c85,
title = "State complexity of Kleene-star operations on regular tree languages",
abstract = "The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. We establish that the worst-case state complexity of bottom-up star is (n + 3/2) · 2n-1. The bound differs by an order of magnitude from the corresponding result for string languages. The state complexity of top-down star is similar as in the string case. We consider also the state complexity of the star of the concatenation of a regular tree language with the set of all trees.",
author = "Yo-Sub Han and Ko, {Sang Ki} and Xiaoxue Piao and Kai Salomaa",
year = "2015",
month = "1",
day = "1",
doi = "10.14232/actacyb.22.2.2015.11",
language = "English",
volume = "22",
pages = "403--422",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "2",

}

State complexity of Kleene-star operations on regular tree languages. / Han, Yo-Sub; Ko, Sang Ki; Piao, Xiaoxue; Salomaa, Kai.

In: Acta Cybernetica, Vol. 22, No. 2, 01.01.2015, p. 403-422.

Research output: Contribution to journalArticle

TY - JOUR

T1 - State complexity of Kleene-star operations on regular tree languages

AU - Han, Yo-Sub

AU - Ko, Sang Ki

AU - Piao, Xiaoxue

AU - Salomaa, Kai

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. We establish that the worst-case state complexity of bottom-up star is (n + 3/2) · 2n-1. The bound differs by an order of magnitude from the corresponding result for string languages. The state complexity of top-down star is similar as in the string case. We consider also the state complexity of the star of the concatenation of a regular tree language with the set of all trees.

AB - The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. We establish that the worst-case state complexity of bottom-up star is (n + 3/2) · 2n-1. The bound differs by an order of magnitude from the corresponding result for string languages. The state complexity of top-down star is similar as in the string case. We consider also the state complexity of the star of the concatenation of a regular tree language with the set of all trees.

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

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

U2 - 10.14232/actacyb.22.2.2015.11

DO - 10.14232/actacyb.22.2.2015.11

M3 - Article

VL - 22

SP - 403

EP - 422

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 2

ER -