De Bruijn sequences are cyclic sequences characterised by the property that every possible subsequence of a given length over a fixed alphabet appears exactly once. Their study intertwines with that ...

This is a preview. Log in through your library . Abstract Let $\{f_k\}$ be a sequence of continuous real valued functions defined on an interval $I$ and $N$ a fixed ...

The longest common subsequence (LCS) problem, a long‐standing challenge in computer science and bioinformatics, seeks to identify the maximum sequence of characters shared by multiple strings while ...

This is a preview. Log in through your library . Abstract Ryll-Nardzewski has proved that an infinite sequence of random variables is exchangeable if every subsequence has the same distribution. We ...