A sequence over an alphabet Z is called disjunctirr if it contains all possible finite strings over .Z as its substrings. Disjunctive sequences have been recently studied in various contexts. They abound in both category and measure senses. In this paper we measure the complexity of a sequence x by
Generalisations of disjunctive sequences
โ Scribed by Cristian S. Calude; Ludwig Staiger
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 171 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F . We show that a definition like "every subword which occurs at infinitely many different positions in sequences in F has to occur infinitely often in the sequence" fulfils properties similar to the original unrelativised notion of disjunctiveness. Finally, we investigate our concept of generalised disjunctiveness in spaces of Cantor expansions of reals.
๐ SIMILAR VOLUMES
In this paper we characterise all graphic bipartitioned sequences for which there is at least one generalised bipartite self-complementary realisation. We also characterise all generalised bipartite self-complementary trees and unicyclic connected graphs. (~