Skip to main content
SpringerLink
Log in

Do there exist languages with an arbitrarily small amount of context-sensitivity?

  • Chapter
  • First Online:
Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 270))

  • 132 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Brandenburg, F.J., On one-way auxiliary pushdown automata, Proc. of the 3rd Gl Conference 1977, LNCS 48 (1977), 132–144

    Google Scholar 

  2. Chytil, M.P., Analysis of the non-context-free component of formallanguages, Proc. of the 5th MFCS Conference 1976, LNCS 45 (1976), 230–236

    Google Scholar 

  3. Chytil, M.P., Comparisions of the active visiting and the crossing complexities, Proc. of the 6th MFCS Conference 1977, LNCS 53 (1977), 272–281

    Google Scholar 

  4. Chytil, M.P., The lower bound for context-sensitivity: a correction, Memorandum 382, Twente University of Technology, Enschede 1982

    Google Scholar 

  5. Chytil, M.P., Almost context-free languages, to appear in Fundamenta Mathematicae, Dec. 1986

    Google Scholar 

  6. Chytil, M.P., Kins of context-free languages, manuscript 1986

    Google Scholar 

  7. Karpinski, M., Verbeek, R., On Monte-Carlo space-constructible functions and separation results for probabilistic complexity classes, Internal report 1/3, Institut für Informatik, Bonn University, 1984

    Google Scholar 

  8. McCreight, E.M., Meyer, A.R., Classes of computable functions defined by bounds on computation, Proc. of the 1st STOC Conference 1969, 79–88

    Google Scholar 

  9. Wechsung, G., Brandstädt, A., A relation between space, return and dual return complexities, Theoretical Computer Science 9(1979), 127–140

    Google Scholar 

  10. Wechsung, G., Kompliziertheitstheoretische Charakterisierung der context-freien and linearen Sprachen, Elektronische Datenverarbeitung und Kybernetik 12(1976), 289–300.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Augsburg University, D-8900, Augsburg

    Klaus W. Wagner

Authors
  1. Klaus W. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wagner, K.W. (1987). Do there exist languages with an arbitrarily small amount of context-sensitivity?. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_184

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_184

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation