Skip to main content
SpringerLink
Log in

Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The paper presents a generalization of pregroup, by which a freely-generated pregroup is augmented with a finite set of commuting inequations, allowing limited commutativity and cancelability. It is shown that grammars based on the commutation-augmented pregroups generate mildly context-sensitive languages. A version of Lambek’s switching lemma is established for these pregroups. Polynomial parsability and semilinearity are shown for languages generated by these grammars.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Buszkowski W., ‘Lambek grammars based on pregroups’, in P. De Groote, G. Morill, and Ch. Retoré (eds.), Logical Aspects of Computational Linguistics, vol. 2099 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 2001, pp. 95–109.

  2. Francez, N., and M. Kaminski, Pushdown automata with cancellation and commutation-augmented pregroup grammars, in R. Loos, S.Z. Fazekas, and C. Martín-Vide (eds.), Pre-proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA07), Tarragona, Spain, March 29 – April 4, 2007, pp. 7–25.

  3. Hopcroft J.E., Ulmann J.D. (1979) Introduction to Automata Theory, Languages and Computation. Addison Wesley, New York

    Google Scholar 

  4. Lambek, J., ‘Type grammars revisited’, in A. Lecomte, F. Lamarche, and G. Perrier (eds.), Logical Aspects of Computational Linguistics, vol. 1582 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 1999, pp. 1–27.

  5. Lewis H.R, Papadimitriou Ch.H. (1981). Elements of the Theory of Computation. Prentice Hall, Englewood Cliffs, NJ

    Google Scholar 

  6. Michaelis, J., and M. Kracht, ‘Semilinearity as a syntactic invariant’, in Ch. Retoré (ed.), Logical Aspects of Computational Linguistics, vol. 1328 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 1997, pp. 329–345.

  7. Parikh, R. J., ‘On context-free languages’, Journal of the ACM 13, 4 (1966), 570–581

    Google Scholar 

  8. Vijay-Shanker K., David J. Weir (1994). The equivalence of four extensions of context-free grammars’. Mathematical System Theory 27: 511–546

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion-Israel Institute of Technology, Haifa, 32000, Israel

    Nissim Francez & Michael Kaminski

Authors
  1. Nissim Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nissim Francez.

Additional information

Special Issue Categorial Grammars and Pregroups Edited by Wojciech Buszkowski and Anne Preller

Rights and permissions

Reprints and permissions

About this article

Cite this article

Francez, N., Kaminski, M. Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Stud Logica 87, 295–321 (2007). https://doi.org/10.1007/s11225-007-9088-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-007-9088-z

Keywords

Search

Navigation