In an earlier paper, Kinber and Stephan posed an open problem about whether every class of languages, which can be identified strong monotonically, can also be identified by a setdriven machine. We solve this question in this paper. The answer to the question depends on whether the machines are required to be total or not! The solution of this result uncovers a finer gradation of the notion of ...
