no. 1
Single-tape reset machines
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 55-77 
@article{ITA_1986__20_1_55_0,
     author = {Greibach, S. A. and Wrathall, C.},
     title = {Single-tape reset machines},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {55--77},
     year = {1986},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {1},
     mrnumber = {849966},
     zbl = {0585.68073},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1986__20_1_55_0/}
}
TY  - JOUR
AU  - Greibach, S. A.
AU  - Wrathall, C.
TI  - Single-tape reset machines
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
SP  - 55
EP  - 77
VL  - 20
IS  - 1
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - https://www.numdam.org/item/ITA_1986__20_1_55_0/
LA  - en
ID  - ITA_1986__20_1_55_0
ER  - 
%0 Journal Article
%A Greibach, S. A.
%A Wrathall, C.
%T Single-tape reset machines
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 55-77
%V 20
%N 1
%I AFCET - Gauthier-Villars
%C Paris
%U https://www.numdam.org/item/ITA_1986__20_1_55_0/
%G en
%F ITA_1986__20_1_55_0
Greibach, S. A.; Wrathall, C. Single-tape reset machines. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 55-77. https://www.numdam.org/item/ITA_1986__20_1_55_0/

1. E. K. Blum, A Note on Free Subsemigroups with Two Generators, Bull. Amer. Math. Soc., Vol. 71, 1965, pp. 678-679. | Zbl | MR

2. L. Boasson and M. Nivat, Sur diverses familles de langages fermés par transduction rationnelle, Acta Inf., Vol. 2, 1973, pp. 180-188. | Zbl | MR

3. R. Book, S. Greibach and C. Wrathall, Reset Machines, J. Comput. Syst. Sc., Vol 19, 1979, pp. 256-276. | Zbl | MR

4. S. Ginsburg and E. H. Spanier, Bounded Regular Sets, Proc. Amer. Math. Soc., Vol. 17, 1966, pp. 1043-1049. | Zbl | MR

5. S. Ginsburg and E. H. Spanier, Bounded Algol-Like Languages, Trans. Amer. Math. Soc., Vol. 113, 1964, pp. 333-368. | Zbl | MR

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

7. S. Greibach, Erasable Context-Free Languages, Inf. Control, Vol. 29, 1975, pp. 301-326. | Zbl | MR

8. S. Greibach, Erasing in Context-Free AFLs, Inf. Control, Vol. 21, 1972, pp. 436-465. | Zbl | MR

9. R. Hull, Reset Languages, Ph. D. dissertation, University of California at Berkeley, 1979.

10. K. Klingenstein, Structures of Bounded Languages in Certain Families of Languages, Ph. D. dissertation, University of California at Berkeley, 1975.

11. M. Latteux, Cônes rationnels commutativement clos, R.A.I..R.O.-Informatique théorique, Vol. 11, 1977, pp. 29-51. | Zbl | MR | Numdam

12. M. LOTHAIRE, ed., Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982. | Zbl | MR

13. R. Siromoney, On Equal Matrix Languages, Inf. Control, Vol. 14, 1969, pp. 135-151. | Zbl | MR

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

15. R. Siromoney, Finite-Turn Checking Automata, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 549-559. | Zbl | MR

16. O. Ibarra, Simple Matrix Languages, Inf. Control, Vol. 17, 1970, pp. 359-394. | Zbl | MR

17. S. Ginsburg and S. Greibach, On AFL Generators for Finitely Encoded AFA, J. Comput. Syst. Sc., Vol. 7, 1973, pp. 1-27. | Zbl | MR

18. F.-J. Brandenburg, Multiple Equality Sets and Post Machines, J. Comput. Syst. Sc., Vol. 21, 1980, pp. 292-316. | Zbl | MR