Chains of Finite Automat a with Bounded Number of Chains1
Mirosław Kutyłowski · Fundamenta Informaticae · 1988
Chains of finite automata are considered. We show that if the lowest automaton in a chain controls movements of the common reading head then computing power of the chain is very limited. This is a generalization of Krohn-Rhodes theorem on one-way automata.