|
|||||||||||||||
Theoret. Informatics Appl. 39, 49-65 (2005)
DOI: 10.1051/ita:2005003
Hereditary properties of words
József Balogh1 and Béla Bollobás21 Department of Mathematical Sciences, The Ohio State University, Columbus, OH 43210, USA; jobal@math.ohio-state.edu
2 Department of Mathematical Sciences, The University of Memphis, Memphis, TN 38152, and Trinity College, Cambridge CB2 1TQ, England; bollobas@msci.memphis.edu
Abstract
Let
be a hereditary property of words, i.e., an
infinite class of finite words such that every subword (block) of
a word belonging to
is also in
.
Extending the classical Morse-Hedlund theorem, we show that
either
contains at least
n+1 words of length
n for every
n or, for some
N, it contains at most
N words of length
n for every
n. More importantly, we prove the following quantitative
extension of this result: if
has
words of length
n then, for every
, it contains
at most
words of length
k.
Mathematics Subject Classification. 05C
Key words: Graph properties -- monotone -- hereditary -- speed -- size.
© EDP Sciences 2005
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook