z-logo
open-access-imgOpen Access
Abstract Families of Abstract Categorial Languages
Author(s) -
Makoto Kanazawa
Publication year - 2006
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.05.037
Subject(s) - categorial grammar , combinatory categorial grammar , computer science , programming language , linguistics , mathematics , algebra over a field , pure mathematics , artificial intelligence , philosophy , link grammar , generative grammar , mildly context sensitive grammar formalism , emergent grammar , parsing , attribute grammar
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom