On a construction of Friedman

MaRDI QIDQ6470608zbMATH OpenFDO

Authors Jeffrey Shallit, Ming-wei Wang

Publication date 8 September 2000

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: H. Friedman obtained remarkable results about the longest finite sequence $x$ such that for all $iot=j$ the word $x[i\mathrm{..2}i]$ is not a subsequence of $x[j\mathrm{..2}j]$. In this note we consider what happens when ``subsequence is replaced by ``subword.

This page was built for publication: On a construction of Friedman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470608)