Deterministic recognition of trees accepted by a linear pushdown tree automaton

Authors:
Akio Fujiyoshi;Ikuo Kawaharada
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Ibaraki, Japan;Graduate School of Electro-Communications, University of Electro-Communications, Tokyo, Japan
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 8
Cited 3

The equivalence of four extensions of context-free grammars

Mathematical Systems Theory
Tree-Adjoining Language Parsing in o(n^6) Time

SIAM Journal on Computing
Tree languages

Handbook of formal languages, vol. 3
Tree-adjoining grammars

Handbook of formal languages, vol. 3
TAL recognition in O(M(n2)) time

Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Linearity and nondeletion on monadic context-free tree grammars

Information Processing Letters
Tree adjunct grammars

Journal of Computer and System Sciences

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

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Recognition of directed acyclic graphs by spanning tree automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a deterministic recognition algorithm for the class of tree languages accepted by (nondeterministic) linear pushdown tree automata (L-PDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield languages generated by tree adjoining grammars (TAGs). The proposed algorithm is obtained by combining a bottom-up parsing procedure on trees with the CKY (Cocke-Kasami-Younger) algorithm. The running time of the algorithm is O(n4), where n is the number of nodes of an input tree.