State complexity of subtree-free regular tree languages

Hae Sung Eom, Yo Sub Han, Sang Ki Ko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We introduce subtree-free regular tree languages that often appear in 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.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings
Number of pages12
StatePublished - 2013
Event15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013 - London, ON, Canada
Duration: 22 Jul 201325 Jul 2013

Publication series

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


Conference15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013
CityLondon, ON


  • basic operations
  • deterministic ranked tree automata
  • state complexity
  • subtree-free regular tree language


Dive into the research topics of 'State complexity of subtree-free regular tree languages'. Together they form a unique fingerprint.

Cite this