Restrictions on monadic context-free tree grammars

Authors:
Akio Fujiyoshi
Affiliations:
Ibaraki University, Hitachi, Ibaraki, Japan
Venue:
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Year:
2004

Citing 4
Cited 2

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-adjoining grammars

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

Journal of Computer and System Sciences

Restarting tree automata and linear context-free tree languages

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
How to train your multi bottom-up tree transducer

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, subclasses of monadic contextfree tree grammars (CFTGs) are compared. Since linear, nondeleting, monadic CFTGs generate the same class of string languages as tree adjoining grammars (TAGs), it is examined whether the restrictions of linearity and nondeletion on monadic CFTGs are necessary to generate the same class of languages. Epsilon-freeness on linear, nondeleting, monadic CFTG is also examined.