Back to Search
Start Over
Upper Bounds on Height of Terms in a Solution of a Semiunification Problem.
- Source :
- Journal of Mathematical Sciences; Nov2003, Vol. 118 Issue 2, p4966-4981, 16p
- Publication Year :
- 2003
-
Abstract
- In this paper, we investigate a decidable case of the term semiunification problem. In our case, the arity of any functional symbol in terms equals one (with a possible exception for outer symbols of terms, for which no restrictions are imposed). We propose an algorithm constructing the most general solution of the semiunification problem. In addition, we prove an upper bound on the height of this solution; this upper bound is linear with respect to heights of terms in the initial problem. Our method reduces the problem for terms to a special system of equations in free semigroups and solves the latter system. Bibliography: 10 titles. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10723374
- Volume :
- 118
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Journal of Mathematical Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 16566776
- Full Text :
- https://doi.org/10.1023/A:1025649322682