Lower bounds on space complexity for contextfree recognition

@article{Alt1979LowerBO,
  title={Lower bounds on space complexity for contextfree recognition},
  author={Helmut Alt},
  journal={Acta Informatica},
  year={1979},
  volume={12},
  pages={33-61}
}
Using methods from linear algebra and crossing-sequence arguments it is shown that logarithmic space is necessary for the recognition of all context-free nonregular subsets of {a1}* ... {an}*, where {a1,...,an} is some alphabet. It then follows that log n is a lower bound on the space complexity for the recognition of any bounded or deterministic non-regular context-free language. 
8 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Komplexit~itstheorie, Vorlesungsskript, WS 1975/76

  • K. Mehlhorn
  • Univ. d. Saarlandes
  • 1975

Dyck-Sprachen sind in Bandkomplexit~it log n analysierbar

  • G. Hotz, J. Messerschmidt
  • Universit~it des Saarlandes
  • 1974
1 Excerpt

Similar Papers

Loading similar papers…