| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422601 | Electronic Notes in Theoretical Computer Science | 2006 | 16 Pages |
Abstract
We show that the class of string languages generated by abstract categorial grammars is a substitution-closed full AFL. The result also holds of each class G(m,n) in de Groote's hierarchy. We also show that the class of string languages generated by lexicalized ACGs is a substitution-closed AFL, and that most of the results about string languages carry over to tree languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
