This paper answers a question of Marcus. Let V be a non-void set and let (S1, S2,… …Sq) be an ordered k-tuple of non-void subsets of V. Consider the language L composed of strings a1a2…an of elements of V such that for some k, if aiϵSk then ai+1ϵSk+1. question is then Where does L fall in the standard hierarchy of formal languages? This question is generalized and answered below.