Loading...
Please wait, while we are loading the content...
Similar Documents
Sequences with Subword Complexity 2n G Unter Rote Sequences with Subword Complexity 2n G Unter Rote
| Content Provider | Semantic Scholar |
|---|---|
| Copyright Year | 1992 |
| Abstract | Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innnite 0-1-sequences which contain 2n diierent sub-words of length n, for every n. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.inf.fu-berlin.de/~rote/Papers/postscript-gzipped/Sequences+with+subword+complexity+2n.ps.gz |
| Alternate Webpage(s) | http://www.inf.fu-berlin.de/~rote/Papers/postscript/Sequences+with+subword+complexity+2n.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |