@article{ITA_1979__13_3_217_0, author = {Alt, Helmut and Mehlhorn, Kurt}, title = {Complexity arguments in algebraic language theory}, journal = {RAIRO. Informatique th\'eorique}, pages = {217--225}, publisher = {EDP-Sciences}, volume = {13}, number = {3}, year = {1979}, mrnumber = {554683}, zbl = {0421.68048}, language = {en}, url = {http://www.numdam.org/item/ITA_1979__13_3_217_0/} }
Alt, Helmut; Mehlhorn, Kurt. Complexity arguments in algebraic language theory. RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 217-225. http://www.numdam.org/item/ITA_1979__13_3_217_0/
1. The Design and Analysis of Computer Algorithms, Addison-Wesley, Publ. Comp., 1974. | MR | Zbl
, and ,2. Lower Bounds for the Space Complexity of Context-Free Recognition, 3rd Coll. on Automata, Languages and Programming, Edinburgh, 1976, pp. 338-354. | Zbl
and ,3. Einige Beobachtungen zum Produkt von Zeit und Platzbedarf bei Turingmaschinen, Universität des Saarlandes, Fachbereich Informatik, Report-A 76/09.
,4. Générateurs algébriques non-ambigus, 3rd Colloquium on Automata, Languages and Programming, Edinburgh, 1976, pp.66-73. | Zbl
,5. Classification of the Context-Free Languages, MFCS 1977, Lecture Notes in Computer Science, Vol. 53, pp. 34-43. | MR | Zbl
,6. Un Langage Algébrique Particulier R.A.I.R.O., Informatique Théorique, (this issue). | Numdam | Zbl
,7. One-Tape Turing Machine Computations, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 325-339. | MR | Zbl
,8. Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. | MR | Zbl
and ,9. Memory Bounds for the Recognition of Context-Free and Context-Sensitive Languages, I.E.E.E. Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 179-202. | Zbl
, and ,