The independence of certain operations on semiAFLs
RAIRO. Informatique théorique, Tome 12 (1978) no. 4, pp. 369-385. 
@article{ITA_1978__12_4_369_0,
     author = {Book, Ronald V. and Greibach, Sheila A.},
     title = {The independence of certain operations on {semiAFLs}},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {369--385},
     publisher = {EDP-Sciences},
     volume = {12},
     number = {4},
     year = {1978},
     mrnumber = {517636},
     zbl = {0388.68068},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1978__12_4_369_0/}
}
TY  - JOUR
AU  - Book, Ronald V.
AU  - Greibach, Sheila A.
TI  - The independence of certain operations on semiAFLs
JO  - RAIRO. Informatique théorique
PY  - 1978
SP  - 369
EP  - 385
VL  - 12
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1978__12_4_369_0/
LA  - en
ID  - ITA_1978__12_4_369_0
ER  - 
%0 Journal Article
%A Book, Ronald V.
%A Greibach, Sheila A.
%T The independence of certain operations on semiAFLs
%J RAIRO. Informatique théorique
%D 1978
%P 369-385
%V 12
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1978__12_4_369_0/
%G en
%F ITA_1978__12_4_369_0
Book, Ronald V.; Greibach, Sheila A. The independence of certain operations on semiAFLs. RAIRO. Informatique théorique, Tome 12 (1978) no. 4, pp. 369-385. http://www.numdam.org/item/ITA_1978__12_4_369_0/

1. B. Baker and R. Book, Reversal-bounded Multipushdown Machine, J. Comput. Syst. Sc., Vol. 8, 1974, pp. 315-332. | MR | Zbl

2. R. Book, Simple Representations of Certain Classes of Languages, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 23-31. | MR | Zbl

3. R. Book and S. Greibach, Quasirealtime Languages, Math. Syst. Theory, Vol. 4, 1970, pp. 97-111. | MR | Zbl

4. R. Book, S. Greibach and C. Wrathall, Comparison and Reset Machines, to be presented at 5th Intl. Golloq. Automata, Languages and Programming, Udine, Italy, 1978. | MR | Zbl

5. R. Book M. Nivat, Linear Languages and the Intersection Closures of Classes of Languages, SIAM J. Computing, Vol. 7, 1978, pp. 167-177. | MR | Zbl

6. R. Book, M. Nivat and M. Paterson, Reversal-bounded Acceptors and Intersections of Linear Languages, SIAM J. Computing, Vol. 3, 1974, pp. 283-295. | MR | Zbl

7. R. Book and B. Wegbreit, A Note on AFLs and Bounded Erasing, Inform. and Control, Vol. 19, 1971, pp. 18-29. | MR | Zbl

8. R. Book and C. Wrathall, On Languages Specified by Relative Acceptance, Theoret. Comput. Sc., Vol. 7, 1978 (to appear). | MR | Zbl

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

10. S. Ginsburg and J. Goldsttne, Intersection Closed full AFL and the Recursively Enumerables Languages, Inform. and Control, Vol. 22, 1973, pp. 201-231. | MR | Zbl

11. S. Ginsburg and S. Greibach, Principal AFL, J. Comput. Syst. Sc., Vol. 4, 1970, pp. 308-338. | MR | Zbl

12. S. Ginsburg, S. Greibach and M. A. Harrison, One-way Stack Automata, J. Assoc. Comput. Mach., Vol. 14, 1967, pp. 389-418. | MR | Zbl

13. S. Ginsburg and E. H. Spanier, AFL with the Semilinear Property, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 365-396. | MR | Zbl

14. J. Goldstine, Continuous Operations on Languages, Math. Syst. Theory, Vol. 11, 1977, pp. 29-46. | MR | Zbl

15. S. Greibach, The Unsolvability of the Recognition of Linear Context-free Languages, J. Assoc Comput. Mach., Vol. 13, 1966, pp. 582-587. | MR | Zbl

16. S. Greibach, An Infinite Hierarchy of Context-free Languages, J. Assoc. Comput. Mach., Vol. 16, 1969, pp. 91-106. | MR | Zbl

17. S. Greibach, Erasing on Context-free AFLs, Inform. and Control, Vol. 21, 1972, pp. 436-465. | MR | Zbl

18. S. Greibach, Syntactic Operators on Full semi AFLs, J. Comput. Syst. Sc., Vol. 6, 1972, pp. 30-76. | MR | Zbl

19. S. Greibach, Remarks on the Complexity of Nondeterministic Counter Languages, Theoret. Comput. Sc., Vol. 1, 1976, pp. 269-288. | MR | Zbl

20. S. Greibach, Control Sets on Context-free Grammar Forms, J. Comput. Syst. Sc., Vol. 15, 1977, pp. 35-98. | MR | Zbl

21. S. Greibach, One-way Finite Visit Automata, Theoret. Comput. Sc, Vol. 6, 1978, pp. 175-221. | MR | Zbl

22. S. Greibach, Remarks on Blind and Partially Blind Multicounter Machines, Theoret. Comput. Sc. (to appear). | Zbl

23. S. Greibach and S. Ginsburg, Multitape AFA, J. Assoc. Comput. Mach., Vol. 19, 1972, pp. 193-21. | MR | Zbl

24. K. Kligenstein, Structures of Bounded Languages in Certain Classes of Languages, Inform. and Control (to appear).

25. K. Klingenstein, ρ-matrix Languages, Theoret. Comput. Sc. (to appear).

26. J. L. Peterson, Computation Sequence Sets, J. Comput. Syst. Sc, Vol. 13, 1976, pp. 1-24. | MR | Zbl

27. V. Rajlich, Absolutely Parallel Grammars and two-way Finite-state Transducers, J. Comput. Syst. Sc, Vol. 6, 1972, pp. 324-342. | MR | Zbl

28. V. Rajlich, Bounded-crossing transducers, Inform. and Control, Vol. 27, 1975, pp. 329-335. | MR | Zbl

29. J. I. Seiferas, M. J. Fischer and A. R. Meyer, Separating Deterministic time Complexity Classes, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 146-167. | MR | Zbl

30. G. S. Sacerdote and R. L. Tenney, The Dedidability of the Reachability Problem for Vector Addition Systems, Proc. 9th Annual Symposium on Theory of Computing, Boulder, Colorado, May 1977, pp. 61-76. | MR

31. R. Siromoney, On Equal Matrix Languages, Inform. and Control, Vol. 14, 1969, pp. 135-151. | MR | Zbl