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.
|Number of pages||20|
|Journal||International Journal of Foundations of Computer Science|
|Publication status||Published - 2016 Sep 1|
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)