识别Thue系统不可约字集的有穷自动机的一个构作
CONSTRUCTION OF A FINITE AUTOMATON RECOGNIZING THE SET OF IRREDUCIBLE WORDS OF THE THUE SYSTEM
-
摘要: 本文给出了识别Ｔｈｕｅ系统不可约字集的有穷自动机的一个新的构作Abstract: This paper gives the new construction of a finite automaton that recognizes the set of irreducible words of the Thue system.
下载: