Article ID Journal Published Year Pages File Type
10332143 Information Processing Letters 2005 5 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Linearity and nondeletion on monadic context-free tree grammars
Authors
,