English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

The Recognition of Deterministic CFL's in Small Time and Space

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1-s2.0-S0019995883800497-main.pdf
(Publisher version), 766KB

Supplementary Material (public)
There is no public supplementary material available
Citation

von Braunmühl, B., Cook, S., Mehlhorn, K., & Verbeek, R. (1983). The Recognition of Deterministic CFL's in Small Time and Space. Information and Control, 56(1-2), 34-51. doi:10.1016/S0019-9958(83)80049-7.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF2D-B
Abstract
Let S(n) be a nice space bound such that log2 n S(n) n. Then every DCFL is
recognized by a multitape Turing machine simultaneously in time O(n2/S(n)) and
space O(S(n)), and this time bound is optimal. If the machine is allowed a
random access input, then the time bound can be improved so that the time-space
product is O(n1 + ).