COMBINATORIAL RECONSTRUCTION OF TWO-DIMENSIONAL WORDS IN THE HYPOTHESIS SHIFT 1

The article considers the formulation of the problem of reconstruction of two-dimensional words by a given multiset of subwords, under the hypothesis that this subset is generated by the displacement of a two-dimensional window of fixed size by an unknown two-dimensional word with a shift 1. A variant of the combinatorial solution of this reconstruction problem is proposed, based on a two-fold application of the one-dimensional word reconstruction method using the search for Eulerian paths or cycles in the de Bruyne multiorgraph. The efficiency of the method is discussed under the conditions of a square two-dimensional shift window one having a large linear size.