To detect and classify λ-voids, we study a way of marking own chains of occurrences of words in each other by the morphism number determined in the N-scheme of the Markov algorithm. In the framework of the category-theoretic approach, the N-scheme of the Markov algorithm is considered as a topos form of the Markov algorithm. The topos explores additional properties of classifiers. The idea of introducing the Markov control flow algorithm into the N-schema is subjected to a comprehensive theoretical analysis. The control flows in the Turing algorithm and the topos form of the Markov algorithm are subjected to a comparative analysis. From the standpoint of the theoretical provisions of the constructivist approach of the Soviet (Leningrad) school, the conditions for equivalence and non-equivalence of the Markov and Turing algorithms are considered. The form of the Markov algorithm equivalent and non-equivalent to the Turing algorithm is synthesized, substantiated and analyzed. To detect the final occurrences in its chain of occurrences, necessary for the detection and classification of λ-voids, the composition of the elements of the N-scheme of the Markov algorithm, which is responsible for this, is specified. For some unknown algorithm for numbering its chains of occurrences of words in each other using the database of the N-scheme of the Markov algorithm, the method of its implementation by the imitating Turing algorithm is considered. The idea of Turing's algorithm imitating some of the algorithms used for the synthesis of artificial intelligence is analyzed. In the context of this study, it is shown that the imitation of the Turing algorithm is due to the need for a second pass through the data, organized by accessing the database in the N-scheme of the Markov algorithm. A description is given for the method of marking own chains of occurrences with the morphism number in the N-scheme of the Markov algorithm. It is concluded that it is necessary to decompose the instruction for checking whether the chain of occurrences belongs to its own chain into fragments, the length of which will be relatively small, for which we consider the method of marking the chains of occurrences with a word, as well as convolution.