Application of the CKY Algorithm to Recognition of Tree Structures for Linear, Monadic Context-Free Tree Grammars

Authors:
Akio Fujiyoshi
Affiliations:
The author is with the Department of Computer and Information Sciences, Ibaraki University, Hitachi-shi, 316--8511 Japan. E-mail: fujiyosi@mx.ibaraki.ac.jp
Venue:
IEICE - Transactions on Information and Systems
Year:
2007

Citing 0
Cited 1

Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a recognition algorithm for the class of tree languages generated by linear, monadic context-free tree grammars (LM-CFTGs) is proposed. LM-CFTGs define an important class of tree languages because LM-CFTGs are weakly equivalent to tree adjoining grammars (TAGs). The algorithm uses the CKY algorithm as a subprogram and recognizes whether an input tree can be derived from a given LM-CFTG in O(n4) time, where n is the number of nodes of the input tree.