Residual Finite Tree Automata

Details Residual Finite Tree Automata Residual Finite Tree Automata

2006-09-05

arxiv.org/abs/cs/0609015v1

Computer Science

Computational Complexity

Scientific paper

Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization of regular tree languages. In the top-down case, we obtain a subclass of regular tree languages which contains the class of languages recognized by deterministic top-down tree automata. RFTA also come with the property of existence of canonical non deterministic tree automata.

Affiliated with

Also associated with

No associations

Rating

Residual Finite 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 Residual Finite Tree Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Residual Finite Tree Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554527