论文信息 - Cyclic Complexity of Some Infinite Words and Generalizations - 字舞流文

Cyclic Complexity of Some Infinite Words and Generalizations

The first author was supported by an NSERC USRA. The second author was supported by an NSERC Discovery Grant.

Narad Rampersad | Colin Krawchuk | N. Rampersad | C. Krawchuk

[1] Jeffrey Shallit,et al. Decision algorithms for Fibonacci-automatic Words, I: Basic results , 2016, RAIRO Theor. Informatics Appl..

[2] Marinella Sciortino,et al. Cyclic complexity of words , 2014, J. Comb. Theory A.

[3] Joe Sawada,et al. Charm bracelets and their application to the construction of periodic Golay pairs , 2015, Discret. Appl. Math..

[4] Jeffrey Shallit,et al. Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability , 2017, Theor. Comput. Sci..

[5] Narad Rampersad,et al. Words with many Palindrome Pair Factors , 2015, Electron. J. Comb..

[6] Luca Q. Zamboni,et al. On a group theoretic generalization of the Morse-Hedlund theorem , 2015, 1505.03848.