Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees

Authors:
Akio Fujiyoshi
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Hitachi, Japan 316-8511
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 1
Cited 1

Deterministic recognition of trees accepted by a linear pushdown tree automaton

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Weak inclusion for XML types

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we will study the use of context-free grammars (CFGs) for the verification of tree structures. Because of the long history of the study of CFGs, parsing techniques for CFGs are well-established. The aim of this paper is to make use of those parsing techniques for the verification of tree structures.