Please use this identifier to cite or link to this item: doi:10.22028/D291-26081
Title: Bracket-languages are recognizable in logarithmic space
Author(s): Mehlhorn, Kurt
Language: English
Year of Publication: 1975
OPUS Source: Saarbrücken, 1975
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: In this paper, we prove lower bounds for the space requirement of the membershipproblem of context-free languages. A contextfree language Lsubseteqsum^{*} is called strongly non-regular if there exist words u,v,w,x,yinsum^{*} with Lcap uv*wx*y non-regular.
Link to this record: urn:nbn:de:bsz:291-scidok-40376
hdl:20.500.11880/26137
http://dx.doi.org/10.22028/D291-26081
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1975/12
Date of registration: 27-Jul-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1975_12.pdf1,32 MBAdobe PDFView/Open


Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.