Regularly Extended Two-Way Nondeterministic Tree Automata

Authors:
Anne Brüggemann-Klein;Derick Wood
Affiliations:
-;-
Venue:
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Year:
2000

Citing 5
Cited 0

Unranked tree languages

Pattern Recognition
On two-way tree automata

Information Processing Letters
Yield-languages of two-way pushdown tree automata

Information Processing Letters
Tree languages

Handbook of formal languages, vol. 3
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is the Extensible Markup Language (XML), a metalanguage for defining document grammars. Such grammars have regular sets of right-hand sides for their productions and tree automata provide an alternative and useful modeling tool for them. In particular, we believe that they provide a useful computational model for what we call caterpillar expressions.