全部 标题 作者
关键词 摘要

Mathematics  2000 

On a construction of Friedman

Full-Text   Cite this paper   Add to My Lib

Abstract:

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

Full-Text

comments powered by Disqus