[1] T. Chan: Reversal complexity of counter machines. In: Proc. IEEE Symposium on Theory of Computing 1981, IEEE, New York, 146-157.

[2] P. Ďuriš, J. Hromkovič: One-way simple multihead finite automata are not closed under concatenation. Theoret. Comput. Sci. 27 (1983), 121 - 225. MR 0742281

[3] P. Ďuriš, Z. Galil: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Inform, artd Control 54 (1982), 3, 217-227. MR 0719444

[4] S. Ginsburg: Algebraic and Automata - Theoretic Properties of Formal Languages. North-Holland Publ. Comp., Amsterdam 1975. MR 0443446 | Zbl 0325.68002

[5] S. A. Greibach: Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7 (1978), 311-324. MR 0513714 | Zbl 0389.68030

[6] M. Hack: Petri Net Languages, Computation Structures. Group Memo 124, Project MAC, MIT, 1975.

[7] J. Hromkovič: Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata. In: Mathematical Foundations of Computer Science 1981 - Proc. 10th Symposium, Štrbské pleso, Czechoslovakia, August 31 - September 4, 1981 (J. Gruska, M. Chytil, eds.). (Lecture Notes in Computer Science 118.) Springer-Verlag, Berlin-Heidelberg-New York 1981, 304-313. MR 0652763

[8] J. Hromkovič: Hierarchy of reversal and zerotesting bounded multicounter machines. In: Mathematical Foundations of Computer Science 1984 - Proc. 11th Symposium, Prague, Czechoslovakia, September 3 - 7, 1984 (M. P. Chytil, V. Koubek, eds.). (Lecture Notes in Computer Science 176.) Springer-Verlag, Berlin-Heidelberg-New York-Tokyo 1984, 312-321. MR 0783460

[9] J. Hromkovič: Reversal bounded multicounter machines. Computers and Artificial Intelligence 4 (1985), 4, 361-366.

[10] O. H. Ibarra: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25 (1978), 116-133. MR 0461988 | Zbl 0365.68059