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

  • Klaus W. Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)


Regular Language Separation Result Binary Description Minimal Growth Rate Nondeterministic Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [Br 77]
    Brandenburg, F.J., On one-way auxiliary pushdown automata, Proc. of the 3rd Gl Conference 1977, LNCS 48 (1977), 132–144Google Scholar
  2. [Ch 76]
    Chytil, M.P., Analysis of the non-context-free component of formallanguages, Proc. of the 5th MFCS Conference 1976, LNCS 45 (1976), 230–236Google Scholar
  3. [Ch 77]
    Chytil, M.P., Comparisions of the active visiting and the crossing complexities, Proc. of the 6th MFCS Conference 1977, LNCS 53 (1977), 272–281Google Scholar
  4. [Ch 82]
    Chytil, M.P., The lower bound for context-sensitivity: a correction, Memorandum 382, Twente University of Technology, Enschede 1982Google Scholar
  5. [Ch 86a]
    Chytil, M.P., Almost context-free languages, to appear in Fundamenta Mathematicae, Dec. 1986Google Scholar
  6. [Ch 86b]
    Chytil, M.P., Kins of context-free languages, manuscript 1986Google Scholar
  7. [KV 84]
    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, 1984Google Scholar
  8. [MM 69]
    McCreight, E.M., Meyer, A.R., Classes of computable functions defined by bounds on computation, Proc. of the 1st STOC Conference 1969, 79–88Google Scholar
  9. [WB 79]
    Wechsung, G., Brandstädt, A., A relation between space, return and dual return complexities, Theoretical Computer Science 9(1979), 127–140Google Scholar
  10. [We 76]
    Wechsung, G., Kompliziertheitstheoretische Charakterisierung der context-freien and linearen Sprachen, Elektronische Datenverarbeitung und Kybernetik 12(1976), 289–300.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Klaus W. Wagner
    • 1
  1. 1.Department of MathematicsAugsburg UniversityAugsburg

Personalised recommendations