TY  - RPRT
T1  - Complexity arguments in algebraic language theory
T3  - Saarbrücken, 1978
A1  - Alt,Helmut
A1  - Mehlhorn,Kurt
Y1  - 2011/07/29
N2  - Each algorithm recognizing any generator of the class of context-free languages requires space Omega(log n) and time x space Omega(n^{2}).
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4041
ER  -