Skip to main content
SpringerLink
Log in

The Boolean Closure of Growing Context-Sensitive Languages

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

The class of growing context-sensitive languages (GCSL) is a naturally defined subclass of context-sensitive languages whose membership problem is solvable in polynomial time. GCSL and its deterministic counterpart called Church-Rosser Languages (CRL) complement the Chomsky hierarchy in a natural way [9]. In this paper, the extension of GCSL obtained by closures of this class under the boolean operations are investigated. We show that there exists an infinite intersection hierarchy, answering an open problem from [1]. Further, we compare the expressive power of the boolean closures of GCSL, CRL, CFL and LOGCFL.

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. Buntrock, G., Loryś, K.: On growing context-sensitive languages. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 77–88. Springer, Heidelberg (1992)

    Google Scholar 

  2. Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. Information and Compation 141(1), 1–36 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences 33(3), 456–472 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Holzer, M., Otto, F.: Shrinking Multi-pushdown Automata. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 305–316. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Jurdzinski, T., Lorys, K.: Church-Rosser Languages vs. UCFL. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 147–158. Springer, Heidelberg (2002), full version: www.ii.uni.wroc.pl/~tju/FullCRL.pdf1

    Chapter  Google Scholar 

  6. Kutrib, M., Malcher, A., Wotschke, D.: The Boolean Closure of Linear Context-Free Languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 284–295. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  8. Liu, L.Y., Weiner, P.: An infinite hierarchy of intersections of context-free languages. Mathematical Systems Theory 7, 185–192 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  9. McNaughton, R.: An insertion into the Chomsky hierarchy? Jewels are Forever, Contributions on Theoretical Computer Science in Honour of A. Salomaa, pp. 204–212. Springer, Heidelberg (1999)

    Google Scholar 

  10. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery 35, 324–344 (1988)

    MATH  MathSciNet  Google Scholar 

  11. Niemann, G.: Church-Rosser Languages and Related Classes. PhD Thesis, Univ. Kassel (2002)

    Google Scholar 

  12. Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inform. and Comp. 197(1-2), 1–21 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Okhotin, A.: Boolean grammars. Information and Computation 194(1), 19–48 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Wotschke, D.: The Boolean Closures of the Deterministisc and Nondeterministic Context-free Languages. In: Brauer, W. (ed.) GI 1973. LNCS, vol. 1, pp. 113–121. Springer, Heidelberg (1973)

    Google Scholar 

  15. Wotschke, D.: A Characterization of Boolean Closures of Families of Languages. In: Böhling, K.-H., Indermark, K. (eds.) GI-Fachtagung 1973. LNCS, vol. 2, pp. 191–200. Springer, Heidelberg (1973)

    Chapter  Google Scholar 

  16. Wotschke, D.: Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci. 16(3), 456–461 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław University, Przesmyckiego 20, PL-51-151, Wrocław, Poland

    Tomasz Jurdziński

Authors
  1. Tomasz Jurdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurdziński, T. (2006). The Boolean Closure of Growing Context-Sensitive Languages. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_23

Download citation

  • DOI: https://doi.org/10.1007/11779148_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation