On Finite Commutative Thue System

有限可交换 Thue 系统

By testing Church-Rosser property of a reduced special Thue system the completion of system can be decided .

对于所考虑的 Thue 系统，检验Church-Rosser性质可进行系统完备化判定。

Construction of a finite automaton recognizing the set of irreducible words of the thue system

识别 Thue 系统不可约字集的有穷自动机的一个 构 作

A finite commutative special Thue system and its word problem are discussed . It is proved that a finite commutative special Thue system is a product of a finite group and a monoid ;

讨论了有限可交换特殊 图厄 系统 （ ∑ ∶ r ）及其字问题，证明了一个有限可交换特殊图厄系统（∑∶r）是一个有限群与一个自由幺半群的直积；

To a finite commutative special Thue system (Σ: R ) R ) is a finite generated 、 commutative group .

对于一个有限可交换的特殊 thue 系统（∑：r），证明了（∑：r）是有限生成交换群；

A decision method of the completion of a finite commutative special Thue system is given .

给出了判定可交换特殊 Thue 系统 完备 化的方法。