Name
Abstract | ||
|---|---|---|
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is investigated. It is demonstrated that the tree languages generated by CCGs can also be generated by simple monadic context-free tree grammars. However, the important subclass of pure combinatory categorial grammars cannot even generate all regular tree languages. Additionally, the tree languages generated by combinatory categorial grammars with limited rule degrees are characterized: If only application rules are allowed, then these grammars can generate only a proper subset of the regular tree languages, whereas they can generate exactly the regular tree languages once first-degree composition rules are permitted. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.jcss.2021.10.005 | Journal of Computer and System Sciences |
Keywords | DocType | Volume |
Combinatory categorial grammar,Regular tree language,Linear context-free tree language | Journal | 124 |
ISSN | Citations | PageRank |
0022-0000 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Kuhlmann | 1 | 309 | 23.06 |
| Andreas Maletti | 2 | 0 | 0.34 |
| Lena Katharina Schiffer | 3 | 0 | 0.34 |