Single-tape reset machines
Greibach, S. A. ; Wrathall, C.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 55-77 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1986-01-01
@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},
     volume = {20},
     year = {1986},
     pages = {55-77},
     mrnumber = {849966},
     zbl = {0585.68073},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 55-77. http://gdmltest.u-ga.fr/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. | MR 177046 | Zbl 0131.02004

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

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

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

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

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

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

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

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. | Numdam | MR 478782 | Zbl 0354.68103

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

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

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

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

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

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

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