A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The time and tape complexity of developmental languages
[chapter]
1977
Lecture Notes in Computer Science
Preserved Fulltext
Abstr@ct The following results are established: EDTOL < DSPACE (log n) if and only if NSPACE (log n) ~ DSPACE (log n) Statement (4) fe[~C~v~ from statement (3) above, the fact that all linear contextfree languages are EDTOL languages [21], and the existence of a linear context-free language which is log-tape complete for NSPACE (log n) [15]. Furthermore, it is shown that all EOL languages are log-tape reducible to context-free languages. Hence, EOL ~ DSPACE (log n) if and only if every context-free language is in DSPACE (log n).
doi:10.1007/3-540-08342-1_40
fatcat:dzoctnvjajfbdjtxu6x6xcgknq