Introduction
This paper presents a precise and detailed study of the complexities of the membership and the universal membership problems for Abstract Categorial Grammars (ACG). ACGs have been introduced by Philippe de Groote in [2] as a simplification over categorial grammars which reduces the number of necessary primitives involved in the definition of the formalism. Thus in ACGs, every structure is represented with the help of the linear λ-calculus and the languages defined by means of ACGs are sets of linear λ-terms. The problem under investigation has already been studied in [7], but we give here some more precise results with some arguably simpler proofs. We use the same classification of the grammars in terms of the order of the lexicon and of the order of abstract language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
de Groote, P.: Towards abstract categorial grammars. In: for Computational Linguistic, A. (ed.) Proceedings 39th Annual Meeting and 10th Conference of the European Chapter, pp. 148–155. Morgan Kaufmann Publishers, San Francisco (2001)
de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13(4), 421–438 (2005)
Kanazawa, M.: Second-order acgs as hyperedge replacement grammars. In: Workshop on New Directions in Type-theoretic Grammars, NDTTG (2007)
Salvati, S.: Syntactic descriptions: a type system for solving matching equations in the linear λ-calculus. In: proceedings of the 17th International Conference on Rewriting Techniques and Applications, pp. 151–165 (2006)
Salvati, S.: Encoding second order string acg with deterministic tree walking transducers. In: Wintner, S. (ed.) Proceedings FG 2006: the 11th conference on Formal Grammars. FG Online Proceedings, pp. 143–156. CSLI Publications, Stanford (2007)
Yoshinaka, R., Kanazawa, M.: The complexity and generative capacity of lexicalized abstract categorial grammars. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 330–346. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salvati, S. (2010). A Note on the Complexity of Abstract Categorial Grammars. In: Ebert, C., Jäger, G., Michaelis, J. (eds) The Mathematics of Language. MOL MOL 2009 2007. Lecture Notes in Computer Science(), vol 6149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14322-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-14322-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14321-2
Online ISBN: 978-3-642-14322-9
eBook Packages: Computer ScienceComputer Science (R0)