Skip to main content

Leftist Grammars Are Non-primitive Recursive

  • Conference paper
Automata, Languages and Programming (ICALP 2008)

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

Included in the following conference series:

Abstract

Leftist grammars were introduced by Motwani et. al. [7], as a tool to show decidability of the accessibility problem in certain general protection systems. It is shown that the membership problem for languages defined by leftist grammars is non-primitive recursive. Therefore, by the reduction of Motwani et. al., the accessibility problem in the appropriate protection systems is non-primitive recursive as well.

Partially supported by MNiSW grant number N206 024 31/3826, 2006-2008.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bandyopadhyay, S., Mahajan, M., Narayan Kumar, K.: A non-regular leftist language (manuscript, 2005)

    Google Scholar 

  2. Cheiner, O., Saraswat, V.: Security Analysis of Matrix. Technical report, AT&T Shannon Laboratory (1999)

    Google Scholar 

  3. Harrison, M., Ruzzo, W., Ullman, J.: Protection in operating systems. Communications of the ACM 19(8), 461–470 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jurdziński, T.: On Complexity of Grammars Related to the Safety Problem. Theoretical Computer Science 389(1-2), 56–72 (2007); An extended abstract appeared in ICALP 2006 Proceedings

    Article  MathSciNet  Google Scholar 

  5. Jurdziński, T.: Leftist Grammars are Non-primitive Recursive, Technical Report of the Institute of Computer Science, University of Wroclaw (2008/01)

    Google Scholar 

  6. Jurdziński, T., Loryś, K.: Leftist Grammars and the Chomsky Hierarchy. Theory of Computing Systems 41(2), 233–256 (2007)

    Article  MathSciNet  Google Scholar 

  7. Motwani, R., Panigrahy, R., Saraswat, V.A., Venkatasubramanian, S.: In: STOC 2000, pp. 306–315 (2000)

    Google Scholar 

  8. Saraswat, V.: The Matrix Design. Technical report, AT&T Laboratory (April 1997)

    Google Scholar 

  9. Saraswat, V., Jagadeesan, R.: Static support for capability-based programming in Java (manuscript)

    Google Scholar 

  10. Schnoebelen, P.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters 83(5), 251–261 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Luca Aceto Ivan Damgård Leslie Ann Goldberg Magnús M. Halldórsson Anna Ingólfsdóttir Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurdziński, T. (2008). Leftist Grammars Are Non-primitive Recursive. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70583-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70582-6

  • Online ISBN: 978-3-540-70583-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics