no. 2
Space classes, intersection of languages and bounded erasing homomorphisms
RAIRO. Informatique théorique, Tome 17 (1983) no. 2, pp. 121-130. 
@article{ITA_1983__17_2_121_0,
     author = {Brandst\"adt, Andreas},
     title = {Space classes, intersection of languages and bounded erasing homomorphisms},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {121--130},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {2},
     year = {1983},
     mrnumber = {713225},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1983__17_2_121_0/}
}
TY  - JOUR
AU  - Brandstädt, Andreas
TI  - Space classes, intersection of languages and bounded erasing homomorphisms
JO  - RAIRO. Informatique théorique
PY  - 1983
SP  - 121
EP  - 130
VL  - 17
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1983__17_2_121_0/
LA  - en
ID  - ITA_1983__17_2_121_0
ER  - 
%0 Journal Article
%A Brandstädt, Andreas
%T Space classes, intersection of languages and bounded erasing homomorphisms
%J RAIRO. Informatique théorique
%D 1983
%P 121-130
%V 17
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1983__17_2_121_0/
%G en
%F ITA_1983__17_2_121_0
Brandstädt, Andreas. Space classes, intersection of languages and bounded erasing homomorphisms. RAIRO. Informatique théorique, Tome 17 (1983) no. 2, pp. 121-130. http://www.numdam.org/item/ITA_1983__17_2_121_0/

1. A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs N.J., 1972. | MR

2. B. S. Baker and R. V. Book, Reversal-Bounded Multipushdown Machines, J. Comp. System Sc., Vol. 8, 1974, pp. 315-332. | MR | Zbl

3. R. V. Book, Translational Lemmas, Polynomial Time and (log n) j-Space, Theor. Comp. Sc., 1976, pp. 215-226. | MR | Zbl

4. R. V. Book, Complexity Classes of Formal Languages, MFCS, 1979, pp. 43-56, Lecture Notes in Comp. Sc., No. 74. | MR | Zbl

5. R. V. Book and F.-J. Brandenburg, Equality Sets and Complexity Classes, S.I.A.M. J. Computing, Vol. 9, No. 4, 1980, pp. 729-743. | MR | Zbl

6. R. V. Book and S. A. Greibach, Quasi-Realtime Languages, Math. Syst. Theory, Vol. 4, No. 2, 1970, pp. 97-111. | MR | Zbl

7. R. V. Book, S. A. Greibach and B. Wegbreit, Time- and Tape-Bouded Turing Acceptors and AFLs, J. Comp. System Sc., Vol. 4, No. 6, 1970, pp. 606-621. | MR | Zbl

8. R. V. Book, M. Nivat and M. Paterson, Reversal-Bounded Acceptors and Intersections of Linear Languages, S.I.A.M. J. Computing, Vol. 3, No. 4, 1974, pp. 283-295. | MR | Zbl

9. K. Culik Ii, Homomorphisms; Decidability, Equality and Test Sets; Formal Language Theory, Perspectives and Open Problems, R. V. Book, Ed., Academic Press, 1980.

10. K. Culik Ii and N. O. Diamond, A Homomorphic Characterization of Time and Space Complexity Classes of Languages, Internat. J. Computer Math. (to appear). | MR | Zbl

11. P. C. Fischer, A. R. Meyer and A. L. Rosenberg, Counter Machines and Counter Languages, Math. Syst. Theory, Vol. 2, No. 3, 1968, pp. 265-283. | MR | Zbl

12. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, 1975. | MR | Zbl

13. S. A Greibach, Remarks on the Complexity of Nondeterministic Counter Languages, Theor. Comp. Sc., Vol. 1, 1976, pp. 269-288. | MR | Zbl

14. J. Hartmanis, Context-Free Languages and Turing Machine Computations, Proc. Symp. Applied Math., Vol. 19, 1967, pp. 42-51. | MR | Zbl

15. O. M. Ibarra, Characterizations of Transductions Deflned by Abstract Families of Transducers Math. Syst. Theory, Vol. 5, 1971, pp. 271-281. | MR | Zbl

16. O. M. Ibarra, Characterization of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multi-Head and Auxiliary Stack Automata, J. Comput. System. Sc., Vol. 5, 1971, pp. 88-117. | MR | Zbl

17. I. H. Sudborough, On the Tape Complexity of Deterministic Context-Free Languages, J. Assoc. Comp. Mach., Vol. 25, 1978, pp. 405-414. | MR | Zbl