Skip to main content
SpringerLink
Log in

Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives

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

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

Abstract

We prove that any language without the empty word, generated by a conjunctive grammar in Greibach normal form, is generated by a grammar based on the Lambek calculus enriched with additive (“intersection” and “union”) connectives.

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. Bar-Hillel, Y., Gaifman, C., Shamir, E.: On the categorial and phrase-structure grammars. Bull. of the Research Council of Israel, Sect. F 9F, 1–16 (1960)

    MathSciNet  Google Scholar 

  2. Buszkowski, W.: The equivalence of unidirectional Lambek categorial grammars and context-free languages. Zeitschr. für math. Logik und Grundl. der Math. 31, 369–384 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Greibach, S.: A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM 12, 42–52 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Jeż, A.: Conjunctive grammars can generate non-regular unary languages. International Journal of Foundations of Computer Science 19(3), 597–615 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kanazawa, M.: The Lambek calculus enriched with additional connectives. Journal of Logic, Language and Information 1, 141–171 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kanazawa, M.: Lambek calculus: recognizing power and complexity. In: Gerbrandy, J., Marx, M., de Rijke, M., Venema, Y. (eds.) JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday. Amsterdam University Press, Vossiuspers (1999)

    Google Scholar 

  7. Lambek, J.: The mathematics of sentence structure. American Math. Monthly 65(3), 154–170 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and its Mathematical Aspects. Amer. Math. Soc. (1961)

    Google Scholar 

  9. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Okhotin, A.: The dual of concatenation. Theor. Comput. Sci. 345(2-3), 425–447 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Okhotin, A., Reitwießner, C.: Conjunctive grammars with restricted disjunction. Theor. Comput. Sci. 411(26-28), 2559–2571 (2010)

    Google Scholar 

  12. Pentus, M.: Lambek grammars are context-free. In: 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433. IEEE Computer Society Press, Los Alamitos (1993)

    Google Scholar 

  13. Safiullin, A.N.: Derivability of admissible rules with simple premises in the Lambek calculus. Moscow University Math. Bull. 62(4), 72–76 (2007)

    MathSciNet  Google Scholar 

  14. Szabari, A.: Alternujúce Zásobníkové Automaty (Alternating Pushdown Automata), in Slovak, diploma work (M. Sc. thesis), University of Košice, Czechoslovakia, p. 45 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Russia

    Stepan Kuznetsov

Authors
  1. Stepan Kuznetsov
    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

Kuznetsov, S. (2013). Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives. 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_15

Download citation

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

  • 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