Computational complementarity was introduced to mimic the physical complementarity in terms of finite automata (with outputs but no initial state). Most of the work has been focussed on "frames", i.e., on fixed, static, local descriptions of the system behaviour. The first paper aiming to study the asymptotical description of complementarity was restricted to certain types of sofic shifts. In this paper we continue this work and extend the results to all irreducible sofic shifts. We also study computational complementarity in terms of labelled graphs rather than automata. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.

complementarity principles, finite automata, sofic shifts, graphs