TY  - RPRT
T1  - Bracket-languages are recognizable in logarithmic space
T3  - Saarbrücken, 1975
A1  - Mehlhorn,Kurt
Y1  - 2011/07/27
N2  - 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.
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4037
ER  -