Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

We give an O (n log⁡ n)-time, O (n)-space algorithm for factoring a string into the minimum
number of palindromic substrings. That is, given a string S [1.. n], in O (n log⁡ n) time our …

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 …

Combinatorics on words aims at finding deep connections between properties of
sequences. The resulting theoretical findings are often used in the design of efficient …

A positive integer n is called a palindrome if the decimal representation of n reads the same
backward as forward. Domotorp asked and Tao answered that the sequence of palindromes …

Let n≥ 0 and b≥ 2 be integers. Then n is said to be a palindrome in base b (or b-adic
palindrome) if n= 0 or n≥ 1 and the representation of n=(akak− 1··· a1a0) b in base b with …

The block reversal of a word w, denoted by BR (w), is a generalization of the concept of the
reversal of a word, obtained by concatenating the blocks of the word in the reverse order …

In combinatorics on words, the well-studied factor complexity function $\rho_ {\bf x} $ of a
sequence ${\bf x} $ over a finite alphabet counts, for any nonnegative integer $ n $, the …

A positive integer $ n $ is said to be a palindrome in base $ b $(or $ b $-adic palindrome) if
the representation of $ n=(a_k a_ {k-1}\cdots a_0) _b $ in base $ b $ with $ a_k\neq 0$ has …

On the least number of palindromes in two-dimensional words - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …