English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Lower Bounds for the Space Complexity of Context-Free Recognition

Alt, H., & Mehlhorn, K. (1976). Lower Bounds for the Space Complexity of Context-Free Recognition. In Third International Colloquium on Automata, Languages and Programming (pp. 338-354). Edinburgh, UK: Edinburgh University Press.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-AFBA-F Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-AFBB-D
Genre: Conference Paper

Files

show Files
hide Files
:
ICALP76.PDF (Any fulltext), 28MB
 
File Permalink:
-
Name:
ICALP76.PDF
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Alt, Helmut1, Author
Mehlhorn, Kurt2, Author              
Michaelson, S., Editor
Milner, R., Editor
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-08-081976
 Publication Status: Published in print
 Pages: -
 Publishing info: Edinburgh, UK : Edinburgh University Press
 Table of Contents: -
 Rev. Method: -
 Identifiers: eDoc: 344661
Other: Local-ID: C1256428004B93B8-0DC1428DF5BE30AFC12571C3001E4E5D-mehlhorn76e
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Edinburgh, UK
Start-/End Date: 1976-07-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Third International Colloquium on Automata, Languages and Programming
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Edinburgh, UK : Edinburgh University Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 338 - 354 Identifier: -