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

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'State complexity of Kleene-star operations on regular tree languages'. Together they form a unique fingerprint.

  • Cite this