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 …

Given a simple graph G with n vertices and a natural number i≤ n, let LG (i) be the
maximum number of leaves that can be realized by an induced subtree T of G with i vertices …

The asymptotic number of prefix normal words - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

An abelian antipower of order k (or simply an abelian k-antipower) is a concatenation of k
consecutive words of the same length having pairwise distinct Parikh vectors. This definition …

Prefix normal words are binary words in which each prefix has at least the same number of 1
s as any factor of the same length. Firstly introduced in 2011, the problem of determining the …

We present a new recursive generation algorithm for prefix normal words. These are binary
words with the property that no factor has more 1s than the prefix of the same length. The …

Prefix normal words are binary words that have no factor with more 1s than the prefix of the
same length. Finite prefix normal words were introduced in [Fici and Lipták, DLT 2011]. In …

We consider the problem LIS of deciding whether there exists an induced subtree with
exactly i ≤ n vertices and ℓ leaves in a given graph G with n vertices. We study the …

A prefix normal word is a binary word with the property that no substring has more 1s than
the prefix of the same length. By proving that the set of prefix normal words is a bubble …

In graph theory, the question of fully leafed induced subtrees has recently been investigated
by Blondin Massé et al. in regular tilings of the Euclidian plane and 3-dimensional space …