Abstract
In this paper we consider different regulation mechanisms imposed upon k-limited ETOL systems. We investigate matrix, periodically time varying, graph-controlled and programmed systems on the one side and random context and random context with appearance checking systems on the other side. We also regard mixtures of these two types. By these means, in case of k-limited TOL systems, we increase the generative power of the systems while in case of k-limited ETOL systems this is, at least partially, not true. We compare the different language families with each other as well as with other known language families.