We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Tribonacci-automatic". This class includes, for example, the famous Tribonacci word T = 0102010010201…, the fixed point of the morphism 0 → 01, 1 → 02, 2 → 0. We use our decision procedure to reprove some old results about the Tribonacci word from the literature, such as assertions about the occurrences in T of squares, cubes, palindromes, and so forth. We also obtain some new results, including on enumeration.
展开▼
机译：我们实施了一个决定程序，以回答有关可能被调用的一类无限单词的问题（因为缺乏更好的名称）“TribonAcci-Automation”。例如，此类包括着名的TribonAcci Word T = 0102010010201 ......，态度的固定点0→01,1→02,2→0.我们使用我们的决策程序责备一些关于Tribonacci字的旧结果文学，例如关于正方形，立方体，回文等的发生的断言。我们还获得了一些新的结果，包括枚举。
展开▼
