Geodesic
Complexity arguments in algebraic language theory
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 3, pp. 217-225.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1979__13_3_217_0,
     author = {Alt, Helmut and Mehlhorn, Kurt},
     title = {Complexity arguments in algebraic language theory},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {217--225},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {3},
     year = {1979},
     mrnumber = {554683},
     zbl = {0421.68048},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1979__13_3_217_0/}
}
TY  - JOUR
AU  - Alt, Helmut
AU  - Mehlhorn, Kurt
TI  - Complexity arguments in algebraic language theory
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1979
SP  - 217
EP  - 225
VL  - 13
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1979__13_3_217_0/
LA  - en
ID  - ITA_1979__13_3_217_0
ER  - 
%0 Journal Article
%A Alt, Helmut
%A Mehlhorn, Kurt
%T Complexity arguments in algebraic language theory
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1979
%P 217-225
%V 13
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1979__13_3_217_0/
%G en
%F ITA_1979__13_3_217_0
Alt, Helmut; Mehlhorn, Kurt. Complexity arguments in algebraic language theory. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 3, pp. 217-225. http://geodesic.mathdoc.fr/item/ITA_1979__13_3_217_0/

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Publ. Comp., 1974. | Zbl | MR

2. H. Alt and K. Mehlhorn, Lower Bounds for the Space Complexity of Context-Free Recognition, 3rd Coll. on Automata, Languages and Programming, Edinburgh, 1976, pp. 338-354. | Zbl

3. H. Alt, Einige Beobachtungen zum Produkt von Zeit und Platzbedarf bei Turingmaschinen, Universität des Saarlandes, Fachbereich Informatik, Report-A 76/09.

4. J. Beauquier, Générateurs algébriques non-ambigus, 3rd Colloquium on Automata, Languages and Programming, Edinburgh, 1976, pp.66-73. | Zbl

5. L. Boasson, Classification of the Context-Free Languages, MFCS 1977, Lecture Notes in Computer Science, Vol. 53, pp. 34-43. | Zbl | MR

6. L. Boasson, Un Langage Algébrique Particulier R.A.I.R.O., Informatique Théorique, (this issue). | Zbl | mathdoc-id

7. J. Hartmanis, One-Tape Turing Machine Computations, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 325-339. | Zbl | MR

8. J. W. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. | Zbl | MR

9. P. M. Lewis, J. Hartmanis and R. E. Stearns, 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