English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  The Recognition of Deterministic CFL's in Small Time and Space

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, 34-51.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
von Braunmühl, Burchard, Author
Cook, Stephen, Author
Mehlhorn, Kurt1, Author           
Verbeek, Rutger, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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 + ).

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-061983
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344634
Other: Local-ID: C1256428004B93B8-3ECB4E3035DE4038C12571C2005B6BB6-mehlhorn83e
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information and Control
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 56 Sequence Number: - Start / End Page: 34 - 51 Identifier: -