Abstract Families of Abstract Categorial Languages

Authors:
Makoto Kanazawa
Affiliations:
National Institute of Informatics, Tokyo, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 11
Cited 2

BCK-combinators and linear &lgr;-terms have types

Theoretical Computer Science
On multiple context-free grammars

Theoretical Computer Science
Basic simple type theory

Basic simple type theory
Tree languages

Handbook of formal languages, vol. 3
Tree-adjoining grammars

Handbook of formal languages, vol. 3
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Vector Addition Tree Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

Journal of Logic, Language and Information
Towards abstract categorial grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The complexity and generative capacity of lexicalized abstract categorial grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

On the Membership Problem for Non-Linear Abstract Categorial Grammars

Journal of Logic, Language and Information
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.01

Visualization

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.