THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6
作者： J. McCAMMOND
DOI: 10.1142/S021819679100002X
关键词:
摘要: In this article the word problem for certain Burnside semigroups is shown to be decidable. For each W ∈ A* a nondeterministic, finite-state automaton constructed. This accepts iff it equivalent under relations Ta = Ta+b, where and b are fixed positive integers T an arbitrary in A*. The method decides those cases ≥ 6. maximal subgroups cyclic groups of order b.
sci-hub.se 参考文章(0)