Linearity and nondeletion on monadic context-free tree grammars

Authors:
Akio Fujiyoshi
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki 316-8511, Japan
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 0

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, subclasses of monadic context-free 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.