Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability

被引：3

作者：

Du, Chen Fei ^{[1
]}

Mousavi, Hamoon ^{[1
]}

Rowland, Eric ^{[2
]}

Schaeffer, Luke ^{[3
]}

Shallit, Jeffrey ^{[1
]}

机构：

[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada

[2] Hofstra Univ, Dept Math, Hempstead, NY 11549 USA

[3] Comp Sci & Artificial Intelligence Lab, Stata Ctr, MIT Bldg 32,32 Vassar St, Cambridge, MA 02139 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2017年 / 657卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Automatic sequence; Decision procedure; Avoidability in words; Finite automata; Fibonacci representation; Palindrome; COMPLEXITY;

D O I：

10.1016/j.tcs.2016.10.005

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We use a decision procedure for the "Fibonacci-automatic" words to solve problems about a number of different sequences. In particular, we prove that there exists an aperiodic infinite binary word avoiding the pattern xxxR. This is the first avoidability result concerning a nonuniform morphism proven purely mechanically. (C) 2016 Elsevier B.V. All rights reserved.

引用

下载

页码：146 / 162

页数：17