Operational State Complexity of Deterministic Unranked Tree Automata

Details Operational State Complexity of Deterministic Unranked Tree Automata Operational State Complexity of Deterministic Unranked Tree Automata

2010-08-10

arxiv.org/abs/1008.1657v1

EPTCS 31, 2010, pp. 149-158

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.17

We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are obtained. For tree concatenation we establish a tight upper bound that is of a different order than the known state complexity of concatenation of regular string languages. We show that (n+1) ( (m+1)2^n-2^(n-1) )-1 vertical states are sufficient, and necessary in the worst case, to recognize the concatenation of tree languages recognized by (strongly or weakly) deterministic automata with, respectively, m and n vertical states.

Affiliated with

Also associated with

No associations

Rating

Operational State Complexity of Deterministic Unranked Tree Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Operational State Complexity of Deterministic Unranked Tree Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operational State Complexity of Deterministic Unranked Tree Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583283