条形码在对合除法中的应用及完备集的贪婪算法
Applications of Bar Code to involutive divisions and a greedy algorithm for complete sets
摘要：
本文描述了如何对一个有限集进行Janet分解，并利用相应的条形码来检测该集的完备性。此外，我们解释了一个算法，找到一个变量排序（如果存在）s.t.根据该排序，给定的项集合是完整的。该算法是贪婪的，从最大到最小的变量构造条形码，用一种回溯技术调整变量排序，从而允许构造所需的排序而无需尝试所有的n！可能的排序
英文摘要：
In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an algorithm to find a variable ordering (if it exists) s.t. a given set of terms is complete according to that ordering. The algorithm is greedy and constructs a Bar Code from the maximal to the minimal variable, adjusting the variable ordering with a sort of backtracking technique, thus allowing to construct the desired ordering without trying all the n! possible orderings
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
