The recognition of deterministic CFLs in small time and space

doi:10.1016/S0019-9958(83)80049-7

Information and Control

Volume 56, Issues 1–2, January–February 1983, Pages 34-51

Information and Cont...

https://doi.org/10.1016/S0019-9958(83)80049-7 Get rights and content

Under a Creative Commons license

open access

Let S(n) be a nice space bound such that log² n ⩽ S(n) ⩽ n. Then every DCFL is recognized by a multitape Turing machine simultaneously in time O(n²/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(n^{1 + ɛ}).