Computational complexity for some problems of two terms unification based on concatenation

Abstract

Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of an unification problem is proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.