Skip to main content
SpringerLink
Log in

On the Generative Power of Discontinuous Lambek Calculus

  • Conference paper
Formal Grammar (FG 2013, FG 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8036))

  • 632 Accesses

Abstract

We prove that the class of languages which are generated by discontinuous Lambek grammars and do not contain the empty word is closed under intersection with regular languages. The size of the grammar for the intersection is linear with respect to the size of the initial discontinuous Lambek grammar.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Ullman, J.: The theory of parsing, translation, and compiling. Prentice-Hall, Inc. (1972)

    Google Scholar 

  2. Bar-Hillel, Y., Gaifman, H., Shamir, E.: On categorial and phrase-structure grammars. Bull. Res. Council Israel Sect. F 9F, 1–16 (1960)

    MathSciNet  Google Scholar 

  3. Kanazawa, M., Salvati, S.: MIX is not a tree-adjoining language. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, pp. 666–674 (2012)

    Google Scholar 

  4. Kuznetsov, S.: Lambek grammars with one division and one primitive type. Logic Journal of the IGPL 20(1), 207–221 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65, 154–170 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  6. Morrill, G., Valentín, O.: On calculus of displacement. In: Proceedings of the 10th International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 45–52 (2010)

    Google Scholar 

  7. Morrill, G., Valentín, O., Fadda, M.: The displacement calculus. Journal of Logic, Language and Information 20(1), 1–48 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pentus, M.: Lambek grammars are context-free. In: Logic in Computer Science, Proceedings of the LICS 1993, pp. 429–433 (1993)

    Google Scholar 

  9. Seki, H., Matsumoto, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Sorokin, A.: Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 319–334. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow Institute of Physics and Technology, Moscow State University, Russia

    Alexey Sorokin

Authors
  1. Alexey Sorokin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Glyn Morrill

  2. School of Computer Science, University of St Andrews, North Haugh, KY16 9SX, St. Andrews, UK

    Mark-Jan Nederhof

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sorokin, A. (2013). On the Generative Power of Discontinuous Lambek Calculus. In: Morrill, G., Nederhof, MJ. (eds) Formal Grammar. FG FG 2013 2012. Lecture Notes in Computer Science, vol 8036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39998-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39998-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39997-8

  • Online ISBN: 978-3-642-39998-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation