Answers are grounded in this paper and cite their sources.
In order to detect and classify -voids in these sources, a method of labeling its chains of occurrences with a word is investigated using the N-scheme of the Markov algorithm. The keys of the database used by the N-schema of the Markov algorithm to record the classified objects and morphisms in the topos are considered as input data for the algorithm that performs the second pass through the data for classifying -voids. The idea of a second pass through the data, using the database, is subjected to critical analysis, in terms of the cost of its implementation and the search for ways to build an algorithm that does not require a second pass through the data. Marking your chains of occurrences in the N-scheme of the Markov algorithm can be done in two main ways, based on the morphism number and the first word in the chain. Marking your chains of occurrences in the N-scheme of the Markov algorithm can be done in two main ways, based on the morphism number and the first word in the chain. This property distinguishes the N-scheme of the Markov algorithm from other algorithms. The control implementation mechanism in the N-scheme of the Markov algorithm is considered for the case of organizing a repeated pass through the data in the database. The method proposed in the study for marking one’s chains of occurrences with a word is considered, in which, during the first pass through the data, the first word in the chain is entered into the database as its unique marker. The mechanism of “stitching” of chains of occurrences in a topos is studied with a different composition of words in chains, a case is highlighted in which the first words in the “stitched” chains are combined into a tuple and form compositions that are unique for each such chain and can be used to mark them. In the course of the study, it was found that in order to detect -voids, it is necessary to process the entire set of such tuples, so they will either have to be placed in memory, or in a file, or in a database, thus, one way or another, implement the algorithm for processing these tuples second pass through the data. Some negative aspects of this approach have been established, for example, the length of markers formed by words can be significant, so it is advisable to collapse them with respect to some function, for example, a hash, synthesizing topos hashes for all given data. It is concluded that it is expedient to study the properties of the hash topos using the alphabet of the M N-scheme of the Markov algorithm for encoding occurrences relative to the previous ones and to synthesize a method for marking own chains of occurrences in the hash topos.
No takes yet. Share an insight, caveat, or question.
V. A. Konovalov (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: